Base | Representation |
---|---|
bin | 1010111010100011100101… |
… | …0111111011111001110010 |
3 | 1120111021221101011220121001 |
4 | 2232220321113323321302 |
5 | 3033111223401413020 |
6 | 41305121344352214 |
7 | 2346023322040045 |
oct | 256507127737162 |
9 | 46437841156531 |
10 | 12001101201010 |
11 | 390770283a489 |
12 | 1419a8861566a |
13 | 6909118a110c |
14 | 2d6bdbd50c5c |
15 | 15c29994250a |
hex | aea395fbe72 |
12001101201010 has 8 divisors (see below), whose sum is σ = 21601982161836. Its totient is φ = 4800440480400.
The previous prime is 12001101200969. The next prime is 12001101201121. The reversal of 12001101201010 is 1010210110021.
It can be written as a sum of positive squares in 2 ways, for example, as 11538868465881 + 462232735129 = 3396891^2 + 679877^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 1200110120101 = 12001101201010 / (1 + 2 + 0 + 0 + 1 + 1 + 0 + 1 + 2 + 0 + 1 + 0 + 1 + 0).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 600055060041 + ... + 600055060060.
Almost surely, 212001101201010 is an apocalyptic number.
12001101201010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12001101201010 is a deficient number, since it is larger than the sum of its proper divisors (9600880960826).
12001101201010 is a wasteful number, since it uses less digits than its factorization.
12001101201010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1200110120108.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 12001101201010 its reverse (1010210110021), we get a palindrome (13011311311031).
The spelling of 12001101201010 in words is "twelve trillion, one billion, one hundred one million, two hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •