Base | Representation |
---|---|
bin | 1110100110110111111101… |
… | …11010001111011110100111 |
3 | 11012201211121100022200002112 |
4 | 13103123332322033132213 |
5 | 13202241420240320403 |
6 | 152152355030231235 |
7 | 6523512101656505 |
oct | 723337672173647 |
9 | 135654540280075 |
10 | 32122042120103 |
11 | a2649773a2021 |
12 | 3729572ab551b |
13 | 14c0131c91870 |
14 | 7d0a02483675 |
15 | 3aa87c18e9d8 |
hex | 1d36fee8f7a7 |
32122042120103 has 16 divisors (see below), whose sum is σ = 36097287145920. Its totient is φ = 28361719524864.
The previous prime is 32122042120081. The next prime is 32122042120159. The reversal of 32122042120103 is 30102124022123.
It is a cyclic number.
It is not a de Polignac number, because 32122042120103 - 28 = 32122042119847 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32122042120183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48295775 + ... + 48956367.
It is an arithmetic number, because the mean of its divisors is an integer number (2256080446620).
Almost surely, 232122042120103 is an apocalyptic number.
32122042120103 is a deficient number, since it is larger than the sum of its proper divisors (3975245025817).
32122042120103 is a wasteful number, since it uses less digits than its factorization.
32122042120103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 823258.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 32122042120103 its reverse (30102124022123), we get a palindrome (62224166142226).
The spelling of 32122042120103 in words is "thirty-two trillion, one hundred twenty-two billion, forty-two million, one hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •