Base | Representation |
---|---|
bin | 11101011101001101001… |
… | …01101001100111011000 |
3 | 10120202102211200001022112 |
4 | 32232212211221213120 |
5 | 113040301210432300 |
6 | 2052542525011452 |
7 | 133060040525621 |
oct | 16564645514730 |
9 | 3522384601275 |
10 | 1012112202200 |
11 | 360263a52760 |
12 | 1441a23b3b88 |
13 | 74598756ba8 |
14 | 36db4d10a48 |
15 | 1b4d9c9be35 |
hex | eba69699d8 |
1012112202200 has 48 divisors (see below), whose sum is σ = 2567084591160. Its totient is φ = 368040800000.
The previous prime is 1012112202197. The next prime is 1012112202209. The reversal of 1012112202200 is 22022112101.
It is a super-2 number, since 2×10121122022002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012112202209) 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, 230023301 + ... + 230027700.
Almost surely, 21012112202200 is an apocalyptic number.
1012112202200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1012112202200 is an abundant number, since it is smaller than the sum of its proper divisors (1554972388960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012112202200 is a wasteful number, since it uses less digits than its factorization.
1012112202200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 460051028 (or 460051019 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1012112202200 its reverse (22022112101), we get a palindrome (1034134314301).
Subtracting from 1012112202200 its reverse (22022112101), we obtain a palindrome (990090090099).
The spelling of 1012112202200 in words is "one trillion, twelve billion, one hundred twelve million, two hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •