Base | Representation |
---|---|
bin | 1010111100010011101101… |
… | …1010001111110000010001 |
3 | 1120121011122000122000221002 |
4 | 2233010323122033300101 |
5 | 3034104344213211423 |
6 | 41331020153111345 |
7 | 2351140232526551 |
oct | 257047332176021 |
9 | 46534560560832 |
10 | 12031200132113 |
11 | 3919448904958 |
12 | 14238886b8555 |
13 | 6936ca5c4316 |
14 | 2d845558d161 |
15 | 15ce5c0ae228 |
hex | af13b68fc11 |
12031200132113 has 8 divisors (see below), whose sum is σ = 12269779192800. Its totient is φ = 11793776418688.
The previous prime is 12031200132071. The next prime is 12031200132121. The reversal of 12031200132113 is 31123100213021.
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 a de Polignac number, because none of the positive numbers 2k-12031200132113 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12031200132163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 288815783 + ... + 288857436.
It is an arithmetic number, because the mean of its divisors is an integer number (1533722399100).
Almost surely, 212031200132113 is an apocalyptic number.
It is an amenable number.
12031200132113 is a deficient number, since it is larger than the sum of its proper divisors (238579060687).
12031200132113 is an equidigital number, since it uses as much as digits as its factorization.
12031200132113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 577673631.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12031200132113 its reverse (31123100213021), we get a palindrome (43154300345134).
The spelling of 12031200132113 in words is "twelve trillion, thirty-one billion, two hundred million, one hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •