Base | Representation |
---|---|
bin | 11101100100110110111… |
… | …000111001000000000011 |
3 | 21012022002021012122021201 |
4 | 131210312320321000003 |
5 | 231244414221223321 |
6 | 4153405031402031 |
7 | 266560524322114 |
oct | 35446670710003 |
9 | 7168067178251 |
10 | 2032440414211 |
11 | 713a536a0169 |
12 | 289a98223317 |
13 | 1198733c533c |
14 | 7052907820b |
15 | 37d05eb2291 |
hex | 1d936e39003 |
2032440414211 has 8 divisors (see below), whose sum is σ = 2152048636080. Its totient is φ = 1912838070528.
The previous prime is 2032440414161. The next prime is 2032440414247. The reversal of 2032440414211 is 1124140442302.
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 2032440414211 - 215 = 2032440381443 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2032440414211.
It is not an unprimeable number, because it can be changed into a prime (2032440414611) 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 7 ways as a sum of consecutive naturals, for example, 747541 + ... + 2150278.
It is an arithmetic number, because the mean of its divisors is an integer number (269006079510).
Almost surely, 22032440414211 is an apocalyptic number.
2032440414211 is a deficient number, since it is larger than the sum of its proper divisors (119608221869).
2032440414211 is a wasteful number, since it uses less digits than its factorization.
2032440414211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2939093.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 2032440414211 its reverse (1124140442302), we get a palindrome (3156580856513).
The spelling of 2032440414211 in words is "two trillion, thirty-two billion, four hundred forty million, four hundred fourteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •