Base | Representation |
---|---|
bin | 1011000010000100101000… |
… | …0111110101011111100001 |
3 | 1120221122020200002010122201 |
4 | 2300201022013311133201 |
5 | 3042220203142241001 |
6 | 41444315024533201 |
7 | 2361244303031230 |
oct | 260411207653741 |
9 | 46848220063581 |
10 | 12130231212001 |
11 | 3957447314a31 |
12 | 143ab05a81201 |
13 | 69cb50459246 |
14 | 2dd16ba72b17 |
15 | 160806206501 |
hex | b084a1f57e1 |
12130231212001 has 8 divisors (see below), whose sum is σ = 13868164376000. Its totient is φ = 10393558795728.
The previous prime is 12130231211999. The next prime is 12130231212019. The reversal of 12130231212001 is 10021213203121.
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 12130231212001 - 21 = 12130231211999 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12130231212001.
It is not an unprimeable number, because it can be changed into a prime (12130231215001) 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, 315166311 + ... + 315204796.
It is an arithmetic number, because the mean of its divisors is an integer number (1733520547000).
Almost surely, 212130231212001 is an apocalyptic number.
It is an amenable number.
12130231212001 is a deficient number, since it is larger than the sum of its proper divisors (1737933163999).
12130231212001 is an equidigital number, since it uses as much as digits as its factorization.
12130231212001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630373863.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 12130231212001 its reverse (10021213203121), we get a palindrome (22151444415122).
The spelling of 12130231212001 in words is "twelve trillion, one hundred thirty billion, two hundred thirty-one million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •