Base | Representation |
---|---|
bin | 1001000110001001000010… |
… | …0111000011100000111000 |
3 | 1022102002121112221020000201 |
4 | 2101202100213003200320 |
5 | 2302324233131202300 |
6 | 33134240240411544 |
7 | 2051361554361523 |
oct | 221422047034070 |
9 | 38362545836021 |
10 | 10001110022200 |
11 | 32064a0974140 |
12 | 1156347616bb4 |
13 | 577140107bab |
14 | 2680b0719bba |
15 | 12524260866a |
hex | 918909c3838 |
10001110022200 has 48 divisors (see below), whose sum is σ = 25366451789160. Its totient is φ = 3636767280000.
The previous prime is 10001110022171. The next prime is 10001110022203. The reversal of 10001110022200 is 222001110001.
It is a super-2 number, since 2×100011100222002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001110022203) 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, 2272977351 + ... + 2272981750.
Almost surely, 210001110022200 is an apocalyptic number.
10001110022200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10001110022200 is an abundant number, since it is smaller than the sum of its proper divisors (15365341766960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001110022200 is a wasteful number, since it uses less digits than its factorization.
10001110022200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4545959128 (or 4545959119 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10001110022200 its reverse (222001110001), we get a palindrome (10223111132201).
The spelling of 10001110022200 in words is "ten trillion, one billion, one hundred ten million, twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •