Base | Representation |
---|---|
bin | 1011001000000000001000… |
… | …1111100110001100011101 |
3 | 1121022101012101122110202011 |
4 | 2302000002033212030131 |
5 | 3100402322223031140 |
6 | 42003203511031221 |
7 | 2401511644512601 |
oct | 262000217461435 |
9 | 47271171573664 |
10 | 12232104502045 |
11 | 399667411261a |
12 | 14567b706b511 |
13 | 6a96370a9c1c |
14 | 304073807501 |
15 | 1632b9b24cea |
hex | b20023e631d |
12232104502045 has 32 divisors (see below), whose sum is σ = 15541778165760. Its totient is φ = 9227022336000.
The previous prime is 12232104501989. The next prime is 12232104502049. The reversal of 12232104502045 is 54020540123221.
It is a happy number.
It is not a de Polignac number, because 12232104502045 - 211 = 12232104499997 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 12232104501998 and 12232104502016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12232104502049) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3635500 + ... + 6138490.
It is an arithmetic number, because the mean of its divisors is an integer number (485680567680).
Almost surely, 212232104502045 is an apocalyptic number.
It is an amenable number.
12232104502045 is a deficient number, since it is larger than the sum of its proper divisors (3309673663715).
12232104502045 is a wasteful number, since it uses less digits than its factorization.
12232104502045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2503837.
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 12232104502045 its reverse (54020540123221), we get a palindrome (66252644625266).
The spelling of 12232104502045 in words is "twelve trillion, two hundred thirty-two billion, one hundred four million, five hundred two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •