Base | Representation |
---|---|
bin | 1001000110101010111001… |
… | …1110110101110111001000 |
3 | 1022102222002010102212000001 |
4 | 2101222232132311313020 |
5 | 2303001342441321300 |
6 | 33142342314252344 |
7 | 2052133054420441 |
oct | 221525636656710 |
9 | 38388063385001 |
10 | 10010201120200 |
11 | 320a336626676 |
12 | 11580641270b4 |
13 | 577c5b702b18 |
14 | 2686d3c862c8 |
15 | 1255c57cc16a |
hex | 91aae7b5dc8 |
10010201120200 has 48 divisors (see below), whose sum is σ = 23303826266580. Its totient is φ = 3998900463360.
The previous prime is 10010201120189. The next prime is 10010201120209. The reversal of 10010201120200 is 202110201001.
It can be written as a sum of positive squares in 6 ways, for example, as 3600362041444 + 6409839078756 = 1897462^2 + 2531766^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 (10010201120209) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 32219919 + ... + 32529118.
Almost surely, 210010201120200 is an apocalyptic number.
10010201120200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10010201120200 is an abundant number, since it is smaller than the sum of its proper divisors (13293625146380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010201120200 is a wasteful number, since it uses less digits than its factorization.
10010201120200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64749826 (or 64749817 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10010201120200 its reverse (202110201001), we get a palindrome (10212311321201).
The spelling of 10010201120200 in words is "ten trillion, ten billion, two hundred one million, one hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •