Base | Representation |
---|---|
bin | 1110100111000111000000… |
… | …11100110110010110001101 |
3 | 11012202121110101012222021110 |
4 | 13103203200130312112031 |
5 | 13202404441441024401 |
6 | 152200212425322233 |
7 | 6524216231414640 |
oct | 723434034662615 |
9 | 135677411188243 |
10 | 32130121033101 |
11 | a268342768a23 |
12 | 372b048636379 |
13 | 14c0b1b974360 |
14 | 7d116b40da57 |
15 | 3aaba15769d6 |
hex | 1d38e073658d |
32130121033101 has 64 divisors (see below), whose sum is σ = 52896630528000. Its totient is φ = 16893059279616.
The previous prime is 32130121033057. The next prime is 32130121033111. The reversal of 32130121033101 is 10133012103123.
It is a happy number.
It is not a de Polignac number, because 32130121033101 - 223 = 32130112644493 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32130121033111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 268526050 + ... + 268645676.
It is an arithmetic number, because the mean of its divisors is an integer number (826509852000).
Almost surely, 232130121033101 is an apocalyptic number.
It is an amenable number.
32130121033101 is a deficient number, since it is larger than the sum of its proper divisors (20766509494899).
32130121033101 is a wasteful number, since it uses less digits than its factorization.
32130121033101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122818.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 32130121033101 its reverse (10133012103123), we get a palindrome (42263133136224).
The spelling of 32130121033101 in words is "thirty-two trillion, one hundred thirty billion, one hundred twenty-one million, thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •