Base | Representation |
---|---|
bin | 1001001111101111010100… |
… | …10111011101110110100101 |
3 | 2122222201110220001102021211 |
4 | 10213313222113131312211 |
5 | 10131104430112411401 |
6 | 111124221504311421 |
7 | 4165640134312063 |
oct | 447675227356645 |
9 | 78881426042254 |
10 | 20332012232101 |
11 | 652983793a0a9 |
12 | 2344591912571 |
13 | b463ba3455cb |
14 | 504108b69033 |
15 | 253d37b4a951 |
hex | 127dea5ddda5 |
20332012232101 has 4 divisors (see below), whose sum is σ = 20332342965312. Its totient is φ = 20331681498892.
The previous prime is 20332012232089. The next prime is 20332012232143. The reversal of 20332012232101 is 10123221023302.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20332012232101 - 213 = 20332012223909 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 (20332012232501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 165274375 + ... + 165397348.
It is an arithmetic number, because the mean of its divisors is an integer number (5083085741328).
Almost surely, 220332012232101 is an apocalyptic number.
It is an amenable number.
20332012232101 is a deficient number, since it is larger than the sum of its proper divisors (330733211).
20332012232101 is an equidigital number, since it uses as much as digits as its factorization.
20332012232101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 330733210.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 20332012232101 its reverse (10123221023302), we get a palindrome (30455233255403).
The spelling of 20332012232101 in words is "twenty trillion, three hundred thirty-two billion, twelve million, two hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •