Base | Representation |
---|---|
bin | 1010111011001100100100… |
… | …1000111101110001110111 |
3 | 1120112100100010020211020002 |
4 | 2232303021020331301313 |
5 | 3033301241400131411 |
6 | 41314141202101515 |
7 | 2346563053636331 |
oct | 256631110756167 |
9 | 46470303224202 |
10 | 12012103130231 |
11 | 3911339075776 |
12 | 142003904a89b |
13 | 6919760228c9 |
14 | 2d75631a4451 |
15 | 15c6e076333b |
hex | aecc923dc77 |
12012103130231 has 8 divisors (see below), whose sum is σ = 12216295884240. Its totient is φ = 11807930302528.
The previous prime is 12012103130143. The next prime is 12012103130257. The reversal of 12012103130231 is 13203130121021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12012103130231 - 234 = 11994923261047 is a prime.
It is a super-2 number, since 2×120121031302312 (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 (12012103130831) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3763166 + ... + 6179451.
It is an arithmetic number, because the mean of its divisors is an integer number (1527036985530).
Almost surely, 212012103130231 is an apocalyptic number.
12012103130231 is a deficient number, since it is larger than the sum of its proper divisors (204192754009).
12012103130231 is an equidigital number, since it uses as much as digits as its factorization.
12012103130231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9963153.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12012103130231 its reverse (13203130121021), we get a palindrome (25215233251252).
The spelling of 12012103130231 in words is "twelve trillion, twelve billion, one hundred three million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •