Base | Representation |
---|---|
bin | 1111000110010000011101… |
… | …00110101001010111011100 |
3 | 11100112220212221011210022112 |
4 | 13203020032212221113130 |
5 | 13322423300101210022 |
6 | 154340005431333152 |
7 | 6664434300341165 |
oct | 743101646512734 |
9 | 140486787153275 |
10 | 33200342210012 |
11 | a64020571241a |
12 | 38825475211b8 |
13 | 156aa18147843 |
14 | 82ac959a476c |
15 | 3c893ca3c8e2 |
hex | 1e320e9a95dc |
33200342210012 has 12 divisors (see below), whose sum is σ = 58100643803496. Its totient is φ = 16600158266160.
The previous prime is 33200342209999. The next prime is 33200342210023. The reversal of 33200342210012 is 21001224300233.
It is a super-2 number, since 2×332003422100122 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 33200342210012.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 4866587 + ... + 9491277.
It is an arithmetic number, because the mean of its divisors is an integer number (4841720316958).
Almost surely, 233200342210012 is an apocalyptic number.
It is an amenable number.
33200342210012 is a deficient number, since it is larger than the sum of its proper divisors (24900301593484).
33200342210012 is a wasteful number, since it uses less digits than its factorization.
33200342210012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6419428 (or 6419426 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 33200342210012 its reverse (21001224300233), we get a palindrome (54201566510245).
The spelling of 33200342210012 in words is "thirty-three trillion, two hundred billion, three hundred forty-two million, two hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •