Base | Representation |
---|---|
bin | 1001001001110111010001… |
… | …10101101010010100100111 |
3 | 2122021102100220002102002112 |
4 | 10210323220311222110213 |
5 | 10114302443010131101 |
6 | 110451352332231235 |
7 | 4145232134255156 |
oct | 444735065522447 |
9 | 78242326072075 |
10 | 20130123130151 |
11 | 6461156796721 |
12 | 231142960b51b |
13 | b3035483a138 |
14 | 4d8435c1959d |
15 | 24d96d91c6bb |
hex | 124ee8d6a527 |
20130123130151 has 2 divisors, whose sum is σ = 20130123130152. Its totient is φ = 20130123130150.
The previous prime is 20130123130141. The next prime is 20130123130207. The reversal of 20130123130151 is 15103132103102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20130123130151 - 214 = 20130123113767 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20130123130121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10065061565075 + 10065061565076.
It is an arithmetic number, because the mean of its divisors is an integer number (10065061565076).
Almost surely, 220130123130151 is an apocalyptic number.
20130123130151 is a deficient number, since it is larger than the sum of its proper divisors (1).
20130123130151 is an equidigital number, since it uses as much as digits as its factorization.
20130123130151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 20130123130151 its reverse (15103132103102), we get a palindrome (35233255233253).
The spelling of 20130123130151 in words is "twenty trillion, one hundred thirty billion, one hundred twenty-three million, one hundred thirty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •