Base | Representation |
---|---|
bin | 10110100110000010… |
… | …11110011111011001 |
3 | 1011022101022210211100 |
4 | 23103001132133121 |
5 | 144320330023301 |
6 | 5323402422013 |
7 | 606412653345 |
oct | 132301363731 |
9 | 34271283740 |
10 | 12130314201 |
11 | 5165278665 |
12 | 2426501909 |
13 | 11b4160315 |
14 | 831060625 |
15 | 4aee12286 |
hex | 2d305e7d9 |
12130314201 has 6 divisors (see below), whose sum is σ = 17521564970. Its totient is φ = 8086876128.
The previous prime is 12130314187. The next prime is 12130314239. The reversal of 12130314201 is 10241303121.
12130314201 is a `hidden beast` number, since 1 + 213 + 0 + 31 + 420 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 11885360400 + 244953801 = 109020^2 + 15651^2 .
It is not a de Polignac number, because 12130314201 - 27 = 12130314073 is a prime.
It is a super-2 number, since 2×121303142012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12130314281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 673906336 + ... + 673906353.
Almost surely, 212130314201 is an apocalyptic number.
It is an amenable number.
12130314201 is a deficient number, since it is larger than the sum of its proper divisors (5391250769).
12130314201 is a wasteful number, since it uses less digits than its factorization.
12130314201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1347812695 (or 1347812692 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 12130314201 its reverse (10241303121), we get a palindrome (22371617322).
The spelling of 12130314201 in words is "twelve billion, one hundred thirty million, three hundred fourteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •