Base | Representation |
---|---|
bin | 10010101111010001… |
… | …010010011110110011 |
3 | 1220221020002221101101 |
4 | 102233101102132303 |
5 | 312201311223011 |
6 | 13124310145231 |
7 | 1311413461336 |
oct | 225721223663 |
9 | 56836087341 |
10 | 20120414131 |
11 | 85954a3a34 |
12 | 3a96352217 |
13 | 1b886181bc |
14 | d8c2ac61d |
15 | 7cb6042c1 |
hex | 4af4527b3 |
20120414131 has 2 divisors, whose sum is σ = 20120414132. Its totient is φ = 20120414130.
The previous prime is 20120414113. The next prime is 20120414161. The reversal of 20120414131 is 13141402102.
Together with previous prime (20120414113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20120414131 - 231 = 17972930483 is a prime.
It is a super-2 number, since 2×201204141312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20120414099 and 20120414108.
It is not a weakly prime, because it can be changed into another prime (20120414161) 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 as a sum of consecutive naturals, namely, 10060207065 + 10060207066.
It is an arithmetic number, because the mean of its divisors is an integer number (10060207066).
Almost surely, 220120414131 is an apocalyptic number.
20120414131 is a deficient number, since it is larger than the sum of its proper divisors (1).
20120414131 is an equidigital number, since it uses as much as digits as its factorization.
20120414131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 20120414131 its reverse (13141402102), we get a palindrome (33261816233).
The spelling of 20120414131 in words is "twenty billion, one hundred twenty million, four hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •