Base | Representation |
---|---|
bin | 11101011011010111001… |
… | …01000101111010010100 |
3 | 10120122212211210201220020 |
4 | 32231223211011322110 |
5 | 113031234240401322 |
6 | 2052300401505140 |
7 | 133023356615505 |
oct | 16555345057224 |
9 | 3518784721806 |
10 | 1011122200212 |
11 | 35a8a61385a3 |
12 | 143b669421b0 |
13 | 7446b60a6b7 |
14 | 36d1d646bac |
15 | 1b47cde305c |
hex | eb6b945e94 |
1011122200212 has 24 divisors (see below), whose sum is σ = 2391604110336. Its totient is φ = 332423736768.
The previous prime is 1011122200183. The next prime is 1011122200213. The reversal of 1011122200212 is 2120022211101.
It is a junction number, because it is equal to n+sod(n) for n = 1011122200191 and 1011122200200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011122200213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 577123668 + ... + 577125419.
It is an arithmetic number, because the mean of its divisors is an integer number (99650171264).
Almost surely, 21011122200212 is an apocalyptic number.
1011122200212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1011122200212 is an abundant number, since it is smaller than the sum of its proper divisors (1380481910124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011122200212 is a wasteful number, since it uses less digits than its factorization.
1011122200212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1154249167 (or 1154249165 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1011122200212 its reverse (2120022211101), we get a palindrome (3131144411313).
The spelling of 1011122200212 in words is "one trillion, eleven billion, one hundred twenty-two million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.475 sec. • engine limits •