Base | Representation |
---|---|
bin | 1001001111101111101110… |
… | …11010000000001110111111 |
3 | 2122222202001010201000211111 |
4 | 10213313313122000032333 |
5 | 10131110402114013043 |
6 | 111124255321302451 |
7 | 4165645431650254 |
oct | 447676732001677 |
9 | 78882033630744 |
10 | 20332231001023 |
11 | 652993a381467 |
12 | 2344633034a27 |
13 | b46423771886 |
14 | 504129c3542b |
15 | 253d4be6109d |
hex | 127df76803bf |
20332231001023 has 8 divisors (see below), whose sum is σ = 20385257464656. Its totient is φ = 20279268312000.
The previous prime is 20332231000987. The next prime is 20332231001063. The reversal of 20332231001023 is 32010013223302.
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 20332231001023 - 29 = 20332231000511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20332231000985 and 20332231001003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20332231001063) 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, 15305161 + ... + 16580482.
It is an arithmetic number, because the mean of its divisors is an integer number (2548157183082).
Almost surely, 220332231001023 is an apocalyptic number.
20332231001023 is a deficient number, since it is larger than the sum of its proper divisors (53026463633).
20332231001023 is a wasteful number, since it uses less digits than its factorization.
20332231001023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31887305.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 20332231001023 its reverse (32010013223302), we get a palindrome (52342244224325).
The spelling of 20332231001023 in words is "twenty trillion, three hundred thirty-two billion, two hundred thirty-one million, one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •