Base | Representation |
---|---|
bin | 10110111101000010… |
… | …10010000010111011 |
3 | 1011210211021111001200 |
4 | 23132201102002323 |
5 | 200214214414321 |
6 | 5354452545243 |
7 | 614244324216 |
oct | 133641220273 |
9 | 34724244050 |
10 | 12323201211 |
11 | 5254142512 |
12 | 247b022223 |
13 | 12150c6b49 |
14 | 84c91077d |
15 | 4c1d13d26 |
hex | 2de8520bb |
12323201211 has 12 divisors (see below), whose sum is σ = 18574100688. Its totient is φ = 7858273104.
The previous prime is 12323201197. The next prime is 12323201227. The reversal of 12323201211 is 11210232321.
12323201211 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 12323201211 - 26 = 12323201147 is a prime.
It is a super-2 number, since 2×123232012112 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12323201711) 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, 29765980 + ... + 29766393.
It is an arithmetic number, because the mean of its divisors is an integer number (1547841724).
Almost surely, 212323201211 is an apocalyptic number.
12323201211 is a deficient number, since it is larger than the sum of its proper divisors (6250899477).
12323201211 is a wasteful number, since it uses less digits than its factorization.
12323201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59532402 (or 59532399 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 12323201211 its reverse (11210232321), we get a palindrome (23533433532).
The spelling of 12323201211 in words is "twelve billion, three hundred twenty-three million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •