Base | Representation |
---|---|
bin | 1011000000011000110111… |
… | …0000010011100010000011 |
3 | 1120211212120111000100112102 |
4 | 2300012031300103202003 |
5 | 3041231431041420303 |
6 | 41423132212421015 |
7 | 2356201344240065 |
oct | 260061560234203 |
9 | 46755514010472 |
10 | 12101301123203 |
11 | 3946151005036 |
12 | 143539131776b |
13 | 69a1bc93b5c6 |
14 | 2db9c5773735 |
15 | 15ebb14bd288 |
hex | b018dc13883 |
12101301123203 has 8 divisors (see below), whose sum is σ = 12435006018240. Its totient is φ = 11767945844160.
The previous prime is 12101301123193. The next prime is 12101301123209. The reversal of 12101301123203 is 30232110310121.
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 12101301123203 - 212 = 12101301119107 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12101301123209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87333818 + ... + 87472271.
It is an arithmetic number, because the mean of its divisors is an integer number (1554375752280).
Almost surely, 212101301123203 is an apocalyptic number.
12101301123203 is a deficient number, since it is larger than the sum of its proper divisors (333704895037).
12101301123203 is a wasteful number, since it uses less digits than its factorization.
12101301123203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174807997.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12101301123203 its reverse (30232110310121), we get a palindrome (42333411433324).
The spelling of 12101301123203 in words is "twelve trillion, one hundred one billion, three hundred one million, one hundred twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •