Base | Representation |
---|---|
bin | 1001001111011101010010… |
… | …10000101011101010000001 |
3 | 2122221210111010020001202221 |
4 | 10213232221100223222001 |
5 | 10130430112440000001 |
6 | 111115541032411041 |
7 | 4165145165561131 |
oct | 447565120535201 |
9 | 78853433201687 |
10 | 20322330000001 |
11 | 6525719534897 |
12 | 234272b246a81 |
13 | b455064373a3 |
14 | 50386acc2ac1 |
15 | 25396cb0b1a1 |
hex | 127ba942ba81 |
20322330000001 has 8 divisors (see below), whose sum is σ = 20425647204864. Its totient is φ = 20219014393200.
The previous prime is 20322329999921. The next prime is 20322330000023. The reversal of 20322330000001 is 10000003322302.
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 20322330000001 - 211 = 20322329997953 is a prime.
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 20322330000001.
It is not an unprimeable number, because it can be changed into a prime (20322330000061) 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, 31592226 + ... + 32229076.
It is an arithmetic number, because the mean of its divisors is an integer number (2553205900608).
Almost surely, 220322330000001 is an apocalyptic number.
It is an amenable number.
20322330000001 is a deficient number, since it is larger than the sum of its proper divisors (103317204863).
20322330000001 is a wasteful number, since it uses less digits than its factorization.
20322330000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 799031.
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 20322330000001 its reverse (10000003322302), we get a palindrome (30322333322303).
The spelling of 20322330000001 in words is "twenty trillion, three hundred twenty-two billion, three hundred thirty million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •