Base | Representation |
---|---|
bin | 1001001001110111010001… |
… | …10101101010010101110111 |
3 | 2122021102100220002102012111 |
4 | 10210323220311222111313 |
5 | 10114302443010131411 |
6 | 110451352332231451 |
7 | 4145232134255332 |
oct | 444735065522567 |
9 | 78242326072174 |
10 | 20130123130231 |
11 | 6461156796794 |
12 | 231142960b587 |
13 | b3035483a19a |
14 | 4d8435c19619 |
15 | 24d96d91c721 |
hex | 124ee8d6a577 |
20130123130231 has 4 divisors (see below), whose sum is σ = 21189603295000. Its totient is φ = 19070642965464.
The previous prime is 20130123130217. The next prime is 20130123130237. The reversal of 20130123130231 is 13203132103102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20130123130231 - 235 = 20095763391863 is a prime.
It is a super-2 number, since 2×201301231302312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20130123130237) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 529740082356 + ... + 529740082393.
It is an arithmetic number, because the mean of its divisors is an integer number (5297400823750).
Almost surely, 220130123130231 is an apocalyptic number.
20130123130231 is a deficient number, since it is larger than the sum of its proper divisors (1059480164769).
20130123130231 is a wasteful number, since it uses less digits than its factorization.
20130123130231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1059480164768.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 20130123130231 its reverse (13203132103102), we get a palindrome (33333255233333).
The spelling of 20130123130231 in words is "twenty trillion, one hundred thirty billion, one hundred twenty-three million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •