Base | Representation |
---|---|
bin | 1001010110010010011… |
… | …00100101100101101101 |
3 | 1010201002012022002221121 |
4 | 10223021030211211231 |
5 | 20230310443200023 |
6 | 403320401100541 |
7 | 32130466205425 |
oct | 4531114454555 |
9 | 1121065262847 |
10 | 321203100013 |
11 | 11424885a154 |
12 | 52302327751 |
13 | 2439b844a33 |
14 | 11791123485 |
15 | 854dd78d5d |
hex | 4ac932596d |
321203100013 has 12 divisors (see below), whose sum is σ = 334880139904. Its totient is φ = 307763766000.
The previous prime is 321203100011. The next prime is 321203100089. The reversal of 321203100013 is 310001302123.
It is not a de Polignac number, because 321203100013 - 21 = 321203100011 is a prime.
It is a super-2 number, since 2×3212031000132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 321203100013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (321203100011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 191631 + ... + 824092.
Almost surely, 2321203100013 is an apocalyptic number.
It is an amenable number.
321203100013 is a deficient number, since it is larger than the sum of its proper divisors (13677039891).
321203100013 is a wasteful number, since it uses less digits than its factorization.
321203100013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1015956 (or 1015855 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 321203100013 its reverse (310001302123), we get a palindrome (631204402136).
The spelling of 321203100013 in words is "three hundred twenty-one billion, two hundred three million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •