Base | Representation |
---|---|
bin | 10110110001010000… |
… | …00011101111000111 |
3 | 1011112221012111201220 |
4 | 23120220003233013 |
5 | 200013411024221 |
6 | 5341001251423 |
7 | 611633646216 |
oct | 133050035707 |
9 | 34487174656 |
10 | 12224314311 |
11 | 5203341300 |
12 | 2451a93b73 |
13 | 11ca782ba1 |
14 | 83d72d07d |
15 | 4b82ce0c6 |
hex | 2d8a03bc7 |
12224314311 has 24 divisors (see below), whose sum is σ = 18167893632. Its totient is φ = 7304312400.
The previous prime is 12224314309. The next prime is 12224314339. The reversal of 12224314311 is 11341342221.
12224314311 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 12224314311 - 21 = 12224314309 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12224310311) 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 23 ways as a sum of consecutive naturals, for example, 211381 + ... + 262926.
It is an arithmetic number, because the mean of its divisors is an integer number (756995568).
Almost surely, 212224314311 is an apocalyptic number.
12224314311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12224314311 is a deficient number, since it is larger than the sum of its proper divisors (5943579321).
12224314311 is a wasteful number, since it uses less digits than its factorization.
12224314311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474403 (or 474392 counting only the distinct ones).
The product of its digits is 1152, while the sum is 24.
Adding to 12224314311 its reverse (11341342221), we get a palindrome (23565656532).
The spelling of 12224314311 in words is "twelve billion, two hundred twenty-four million, three hundred fourteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •