Base | Representation |
---|---|
bin | 10011001110010011110… |
… | …001101011100011110101 |
3 | 11200021211010222020221121 |
4 | 103032103301223203311 |
5 | 133120434230442401 |
6 | 2450512540143541 |
7 | 164304313501141 |
oct | 23162361534365 |
9 | 4607733866847 |
10 | 1321034234101 |
11 | 46a27a42763a |
12 | 194037837bb1 |
13 | 9775ab374ca |
14 | 47d1cd70221 |
15 | 2456a885ca1 |
hex | 13393c6b8f5 |
1321034234101 has 8 divisors (see below), whose sum is σ = 1333608157184. Its totient is φ = 1308494250000.
The previous prime is 1321034234033. The next prime is 1321034234119. The reversal of 1321034234101 is 1014324301231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1321034234101 - 27 = 1321034233973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1321034234171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8406525 + ... + 8562226.
It is an arithmetic number, because the mean of its divisors is an integer number (166701019648).
Almost surely, 21321034234101 is an apocalyptic number.
It is an amenable number.
1321034234101 is a deficient number, since it is larger than the sum of its proper divisors (12573923083).
1321034234101 is a wasteful number, since it uses less digits than its factorization.
1321034234101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16969491.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1321034234101 its reverse (1014324301231), we get a palindrome (2335358535332).
The spelling of 1321034234101 in words is "one trillion, three hundred twenty-one billion, thirty-four million, two hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •