Base | Representation |
---|---|
bin | 1001000110110001101001… |
… | …0111010111110000010000 |
3 | 1022110010202021020102011101 |
4 | 2101230122113113300100 |
5 | 2303014044320214300 |
6 | 33143242052354144 |
7 | 2052225653125123 |
oct | 221543227276020 |
9 | 38403667212141 |
10 | 10012011101200 |
11 | 3210085288139 |
12 | 115848a315954 |
13 | 5781896a8bb4 |
14 | 2688263da3ba |
15 | 12567e657b6a |
hex | 91b1a5d7c10 |
10012011101200 has 30 divisors (see below), whose sum is σ = 24053856671594. Its totient is φ = 4004804440320.
The previous prime is 10012011101171. The next prime is 10012011101203. The reversal of 10012011101200 is 210111021001.
It can be written as a sum of positive squares in 3 ways, for example, as 76301907984 + 9935709193216 = 276228^2 + 3152096^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (10012011101203) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 12515013477 + ... + 12515014276.
Almost surely, 210012011101200 is an apocalyptic number.
10012011101200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10012011101200 is an abundant number, since it is smaller than the sum of its proper divisors (14041845570394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10012011101200 is a wasteful number, since it uses less digits than its factorization.
10012011101200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25030027771 (or 25030027760 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10012011101200 its reverse (210111021001), we get a palindrome (10222122122201).
The spelling of 10012011101200 in words is "ten trillion, twelve billion, eleven million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •