Base | Representation |
---|---|
bin | 1011000000010100001000… |
… | …0011010010101111101110 |
3 | 1120211202021222010001100200 |
4 | 2300011002003102233232 |
5 | 3041221330421013202 |
6 | 41422402202134330 |
7 | 2356125022526133 |
oct | 260050203225756 |
9 | 46752258101320 |
10 | 12100031032302 |
11 | 394565a085a34 |
12 | 1435097ab13a6 |
13 | 69a049776125 |
14 | 2db904bda58a |
15 | 15eb39c39e1c |
hex | b01420d2bee |
12100031032302 has 24 divisors (see below), whose sum is σ = 26232460863336. Its totient is φ = 4030924145136.
The previous prime is 12100031032291. The next prime is 12100031032337. The reversal of 12100031032302 is 20323013000121.
12100031032302 is a `hidden beast` number, since 1 + 21 + 0 + 0 + 0 + 310 + 32 + 302 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 201596853 + ... + 201656864.
It is an arithmetic number, because the mean of its divisors is an integer number (1093019202639).
Almost surely, 212100031032302 is an apocalyptic number.
12100031032302 is an abundant number, since it is smaller than the sum of its proper divisors (14132429831034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12100031032302 is a wasteful number, since it uses less digits than its factorization.
12100031032302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 403255392 (or 403255389 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 12100031032302 its reverse (20323013000121), we get a palindrome (32423044032423).
The spelling of 12100031032302 in words is "twelve trillion, one hundred billion, thirty-one million, thirty-two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •