Base | Representation |
---|---|
bin | 1011000000011010111100… |
… | …0010010110101101010100 |
3 | 1120211221000101200222112010 |
4 | 2300012233002112231110 |
5 | 3041234102013043212 |
6 | 41423303440424220 |
7 | 2356221234342243 |
oct | 260065702265524 |
9 | 46757011628463 |
10 | 12101859502932 |
11 | 3946408215a91 |
12 | 1435508318070 |
13 | 69a27b524004 |
14 | 2dba399a495a |
15 | 15ebe551903c |
hex | b01af096b54 |
12101859502932 has 12 divisors (see below), whose sum is σ = 28237672173536. Its totient is φ = 4033953167640.
The previous prime is 12101859502927. The next prime is 12101859502937. The reversal of 12101859502932 is 23920595810121.
It is an interprime number because it is at equal distance from previous prime (12101859502927) and next prime (12101859502937).
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12101859502937) 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, 504244145944 + ... + 504244145967.
Almost surely, 212101859502932 is an apocalyptic number.
12101859502932 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12101859502932 is an abundant number, since it is smaller than the sum of its proper divisors (16135812670604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12101859502932 is a wasteful number, since it uses less digits than its factorization.
12101859502932 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1008488291918 (or 1008488291916 counting only the distinct ones).
The product of its (nonzero) digits is 388800, while the sum is 48.
The spelling of 12101859502932 in words is "twelve trillion, one hundred one billion, eight hundred fifty-nine million, five hundred two thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •