Base | Representation |
---|---|
bin | 1001000110010111111101… |
… | …01010111001011110110001 |
3 | 2121211221220100121202201002 |
4 | 10203023332222321132301 |
5 | 10110321422430314441 |
6 | 110320323425251345 |
7 | 4133456106233543 |
oct | 443137652713661 |
9 | 77757810552632 |
10 | 20010230323121 |
11 | 6415322396235 |
12 | 22b2149793b55 |
13 | b21c5891457c |
14 | 4d2700c17693 |
15 | 24a7a308cb9b |
hex | 1232feab97b1 |
20010230323121 has 8 divisors (see below), whose sum is σ = 20634387481344. Its totient is φ = 19394340147360.
The previous prime is 20010230323103. The next prime is 20010230323147. The reversal of 20010230323121 is 12132303201002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20010230323121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20010230323093 and 20010230323102.
It is not an unprimeable number, because it can be changed into a prime (20010233323121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2066740700 + ... + 2066750381.
It is an arithmetic number, because the mean of its divisors is an integer number (2579298435168).
Almost surely, 220010230323121 is an apocalyptic number.
It is an amenable number.
20010230323121 is a deficient number, since it is larger than the sum of its proper divisors (624157158223).
20010230323121 is a wasteful number, since it uses less digits than its factorization.
20010230323121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4133491231.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20010230323121 its reverse (12132303201002), we get a palindrome (32142533524123).
The spelling of 20010230323121 in words is "twenty trillion, ten billion, two hundred thirty million, three hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •