Base | Representation |
---|---|
bin | 1001000110001001000010… |
… | …0111101110111110011110 |
3 | 1022102002121120021021020010 |
4 | 2101202100213232332132 |
5 | 2302324233202401342 |
6 | 33134240244304050 |
7 | 2051361556032531 |
oct | 221422047567636 |
9 | 38362546237203 |
10 | 10001110200222 |
11 | 32064a0a85969 |
12 | 11563476a2026 |
13 | 57714016ac2b |
14 | 2680b0764a18 |
15 | 12524264129c |
hex | 918909eef9e |
10001110200222 has 32 divisors (see below), whose sum is σ = 20092817003904. Its totient is φ = 3318607594400.
The previous prime is 10001110200203. The next prime is 10001110200251. The reversal of 10001110200222 is 22200201110001.
It is a junction number, because it is equal to n+sod(n) for n = 10001110200198 and 10001110200207.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10679572 + ... + 11578232.
It is an arithmetic number, because the mean of its divisors is an integer number (627900531372).
Almost surely, 210001110200222 is an apocalyptic number.
10001110200222 is an abundant number, since it is smaller than the sum of its proper divisors (10091706803682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001110200222 is a wasteful number, since it uses less digits than its factorization.
10001110200222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 907064.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10001110200222 its reverse (22200201110001), we get a palindrome (32201311310223).
The spelling of 10001110200222 in words is "ten trillion, one billion, one hundred ten million, two hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •