Base | Representation |
---|---|
bin | 11101100100100010101… |
… | …010100011010101010001 |
3 | 21012021012121202020221121 |
4 | 131210202222203111101 |
5 | 231243220341023441 |
6 | 4153311231122241 |
7 | 266546234306224 |
oct | 35444252432521 |
9 | 7167177666847 |
10 | 2032101111121 |
11 | 71389a111794 |
12 | 289a02673381 |
13 | 11981b015c93 |
14 | 704d5d935bb |
15 | 37cd62dcdd1 |
hex | 1d922aa3551 |
2032101111121 has 16 divisors (see below), whose sum is σ = 2142559619200. Its totient is φ = 1921994604288.
The previous prime is 2032101111119. The next prime is 2032101111133. The reversal of 2032101111121 is 1211111012302.
It is a happy number.
It is not a de Polignac number, because 2032101111121 - 21 = 2032101111119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2032101111095 and 2032101111104.
It is not an unprimeable number, because it can be changed into a prime (2032101111101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59005735 + ... + 59040163.
It is an arithmetic number, because the mean of its divisors is an integer number (133909976200).
Almost surely, 22032101111121 is an apocalyptic number.
It is an amenable number.
2032101111121 is a deficient number, since it is larger than the sum of its proper divisors (110458508079).
2032101111121 is a wasteful number, since it uses less digits than its factorization.
2032101111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39448.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 2032101111121 its reverse (1211111012302), we get a palindrome (3243212123423).
The spelling of 2032101111121 in words is "two trillion, thirty-two billion, one hundred one million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •