Base | Representation |
---|---|
bin | 1110100110110110000001… |
… | …10111111001111010100101 |
3 | 11012201201220210212112220022 |
4 | 13103123000313321322211 |
5 | 13202232302314220401 |
6 | 152152103450244525 |
7 | 6523444233216251 |
oct | 723330067717245 |
9 | 135651823775808 |
10 | 32121001320101 |
11 | a264492941631 |
12 | 3729322426745 |
13 | 14bccc746a985 |
14 | 7d0944155261 |
15 | 3aa81aaee71b |
hex | 1d36c0df9ea5 |
32121001320101 has 8 divisors (see below), whose sum is σ = 33941839591680. Its totient is φ = 30335519131632.
The previous prime is 32121001320091. The next prime is 32121001320227. The reversal of 32121001320101 is 10102310012123.
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 32121001320101 - 226 = 32120934211237 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 32121001320101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32121001320301) 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, 8839018910 + ... + 8839022543.
It is an arithmetic number, because the mean of its divisors is an integer number (4242729948960).
Almost surely, 232121001320101 is an apocalyptic number.
It is an amenable number.
32121001320101 is a deficient number, since it is larger than the sum of its proper divisors (1820838271579).
32121001320101 is a wasteful number, since it uses less digits than its factorization.
32121001320101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17678041555.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 32121001320101 its reverse (10102310012123), we get a palindrome (42223311332224).
The spelling of 32121001320101 in words is "thirty-two trillion, one hundred twenty-one billion, one million, three hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •