Base | Representation |
---|---|
bin | 10110110010001100… |
… | …01011101000111001 |
3 | 1011120111001200221220 |
4 | 23121012023220321 |
5 | 200022421223001 |
6 | 5341442422253 |
7 | 612061035513 |
oct | 133106135071 |
9 | 34514050856 |
10 | 12232211001 |
11 | 520784519a |
12 | 2454661989 |
13 | 11cc2b929a |
14 | 8407c6bb3 |
15 | 4b8d3dc36 |
hex | 2d918ba39 |
12232211001 has 12 divisors (see below), whose sum is σ = 17213195952. Its totient is φ = 7725606264.
The previous prime is 12232210987. The next prime is 12232211021. The reversal of 12232211001 is 10011223221.
12232211001 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 12232211001 - 29 = 12232210489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12232211021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5646291 + ... + 5648456.
It is an arithmetic number, because the mean of its divisors is an integer number (1434432996).
Almost surely, 212232211001 is an apocalyptic number.
It is an amenable number.
12232211001 is a deficient number, since it is larger than the sum of its proper divisors (4980984951).
12232211001 is a wasteful number, since it uses less digits than its factorization.
12232211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11294788 (or 11294769 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 12232211001 its reverse (10011223221), we get a palindrome (22243434222).
It can be divided in two parts, 1223221 and 1001, that multiplied together give a palindrome (1224444221).
The spelling of 12232211001 in words is "twelve billion, two hundred thirty-two million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •