Base | Representation |
---|---|
bin | 100100001000000… |
… | …1101110000110111 |
3 | 10010110222122211020 |
4 | 1020100031300313 |
5 | 4440311211411 |
6 | 320141512223 |
7 | 42016421421 |
oct | 11020156067 |
9 | 3113878736 |
10 | 1212210231 |
11 | 572296541 |
12 | 299b72673 |
13 | 1641ab07b |
14 | b6dcb811 |
15 | 7164d606 |
hex | 4840dc37 |
1212210231 has 16 divisors (see below), whose sum is σ = 1624038624. Its totient is φ = 804271104.
The previous prime is 1212210173. The next prime is 1212210247. The reversal of 1212210231 is 1320122121.
It is not a de Polignac number, because 1212210231 - 213 = 1212202039 is a prime.
It is a super-2 number, since 2×12122102312 = 2938907288282146722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1212210231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1212210931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1104475 + ... + 1105571.
It is an arithmetic number, because the mean of its divisors is an integer number (101502414).
Almost surely, 21212210231 is an apocalyptic number.
1212210231 is a deficient number, since it is larger than the sum of its proper divisors (411828393).
1212210231 is a wasteful number, since it uses less digits than its factorization.
1212210231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2530.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1212210231 is about 34816.8096039830. The cubic root of 1212210231 is about 1066.2506650042.
Adding to 1212210231 its reverse (1320122121), we get a palindrome (2532332352).
The spelling of 1212210231 in words is "one billion, two hundred twelve million, two hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •