Base | Representation |
---|---|
bin | 1011000110001000100111… |
… | …0111010110111111100100 |
3 | 1121012022101101012112212000 |
4 | 2301202021313112333210 |
5 | 3044341120122030312 |
6 | 41540340055125300 |
7 | 2366264604631104 |
oct | 261421167267744 |
9 | 47168341175760 |
10 | 12200020111332 |
11 | 3983aaa331a39 |
12 | 1450542073830 |
13 | 6a65c2c30a51 |
14 | 3026ac617204 |
15 | 16253d018adc |
hex | b1889dd6fe4 |
12200020111332 has 96 divisors (see below), whose sum is σ = 31665966796800. Its totient is φ = 4062010208256.
The previous prime is 12200020111327. The next prime is 12200020111351. The reversal of 12200020111332 is 23311102000221.
12200020111332 is a `hidden beast` number, since 1 + 2 + 200 + 0 + 20 + 111 + 332 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 526600413 + ... + 526623579.
It is an arithmetic number, because the mean of its divisors is an integer number (329853820800).
Almost surely, 212200020111332 is an apocalyptic number.
12200020111332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12200020111332 is an abundant number, since it is smaller than the sum of its proper divisors (19465946685468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12200020111332 is a wasteful number, since it uses less digits than its factorization.
12200020111332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28562 (or 28554 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 12200020111332 its reverse (23311102000221), we get a palindrome (35511122111553).
The spelling of 12200020111332 in words is "twelve trillion, two hundred billion, twenty million, one hundred eleven thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •