Base | Representation |
---|---|
bin | 1011000010001100011010… |
… | …1100001100111111101001 |
3 | 1120221211122022121110210022 |
4 | 2300203012230030333221 |
5 | 3042233443201321413 |
6 | 41445302242530225 |
7 | 2361350140664156 |
oct | 260430654147751 |
9 | 46854568543708 |
10 | 12132321120233 |
11 | 3958319a8aa16 |
12 | 143b3a9966975 |
13 | 6a00c4422832 |
14 | 2dd2c945322d |
15 | 1608c9928608 |
hex | b08c6b0cfe9 |
12132321120233 has 12 divisors (see below), whose sum is σ = 12933508026480. Its totient is φ = 11378306490432.
The previous prime is 12132321120119. The next prime is 12132321120239. The reversal of 12132321120233 is 33202112323121.
12132321120233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12132321120233 - 212 = 12132321116137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12132321120239) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 74088443 + ... + 74252016.
It is an arithmetic number, because the mean of its divisors is an integer number (1077792335540).
Almost surely, 212132321120233 is an apocalyptic number.
It is an amenable number.
12132321120233 is a deficient number, since it is larger than the sum of its proper divisors (801186906247).
12132321120233 is a wasteful number, since it uses less digits than its factorization.
12132321120233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 148340776 (or 148340759 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 12132321120233 its reverse (33202112323121), we get a palindrome (45334433443354).
The spelling of 12132321120233 in words is "twelve trillion, one hundred thirty-two billion, three hundred twenty-one million, one hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •