Base | Representation |
---|---|
bin | 1001010001110010011100… |
… | …0001110000101111010000 |
3 | 1100010020002022111000011110 |
4 | 2110130213001300233100 |
5 | 2314114030214214300 |
6 | 33410211220213320 |
7 | 2102004204110445 |
oct | 224344701605720 |
9 | 40106068430143 |
10 | 10201202101200 |
11 | 328333a706690 |
12 | 1189089b3a240 |
13 | 58cc7a526386 |
14 | 273a52b299cc |
15 | 12a553bba550 |
hex | 94727070bd0 |
10201202101200 has 120 divisors (see below), whose sum is σ = 35648564479776. Its totient is φ = 2473018688000.
The previous prime is 10201202101163. The next prime is 10201202101241. The reversal of 10201202101200 is 210120210201.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (12).
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 23 ways as a sum of consecutive naturals, for example, 386395971 + ... + 386422370.
Almost surely, 210201202101200 is an apocalyptic number.
10201202101200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10201202101200 is an abundant number, since it is smaller than the sum of its proper divisors (25447362378576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201202101200 is a wasteful number, since it uses less digits than its factorization.
10201202101200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 772818373 (or 772818362 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10201202101200 its reverse (210120210201), we get a palindrome (10411322311401).
The spelling of 10201202101200 in words is "ten trillion, two hundred one billion, two hundred two million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •