Base | Representation |
---|---|
bin | 1011000110001100010001… |
… | …0101111010100110001010 |
3 | 1121012101220202022000111201 |
4 | 2301203010111322212022 |
5 | 3044400122301400020 |
6 | 41541021303214414 |
7 | 2366331120016000 |
oct | 261430425724612 |
9 | 47171822260451 |
10 | 12201001200010 |
11 | 3984463109427 |
12 | 145077674740a |
13 | 6a671b2791ac |
14 | 302762a40a70 |
15 | 162599211a0a |
hex | b18c457a98a |
12201001200010 has 32 divisors (see below), whose sum is σ = 25611431097600. Its totient is φ = 4183200410256.
The previous prime is 12201001199957. The next prime is 12201001200049. The reversal of 12201001200010 is 1000210010221.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a self number, because there is not a number n which added to its sum of digits gives 12201001200010.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1778568174 + ... + 1778575033.
It is an arithmetic number, because the mean of its divisors is an integer number (800357221800).
Almost surely, 212201001200010 is an apocalyptic number.
12201001200010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12201001200010 is an abundant number, since it is smaller than the sum of its proper divisors (13410429897590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12201001200010 is an equidigital number, since it uses as much as digits as its factorization.
12201001200010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3557143235 (or 3557143221 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 12201001200010 its reverse (1000210010221), we get a palindrome (13201211210231).
The spelling of 12201001200010 in words is "twelve trillion, two hundred one billion, one million, two hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •