Base | Representation |
---|---|
bin | 10000001011110100111… |
… | …100010011001010100100 |
3 | 10221022210220020100200020 |
4 | 100023310330103022210 |
5 | 121210302004311322 |
6 | 2210535341515140 |
7 | 143232424413261 |
oct | 20136474231244 |
9 | 3838726210606 |
10 | 1112211010212 |
11 | 399760135775 |
12 | 15b679272ab0 |
13 | 80b5b8806c3 |
14 | 3bb8d132268 |
15 | 1dde7a0305c |
hex | 102f4f132a4 |
1112211010212 has 24 divisors (see below), whose sum is σ = 2707992025536. Its totient is φ = 354618003168.
The previous prime is 1112211010181. The next prime is 1112211010219. The reversal of 1112211010212 is 2120101122111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1112211010191 and 1112211010200.
It is not an unprimeable number, because it can be changed into a prime (1112211010219) 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, 2014874743 + ... + 2014875294.
It is an arithmetic number, because the mean of its divisors is an integer number (112833001064).
Almost surely, 21112211010212 is an apocalyptic number.
1112211010212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1112211010212 is an abundant number, since it is smaller than the sum of its proper divisors (1595781015324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112211010212 is a wasteful number, since it uses less digits than its factorization.
1112211010212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4029750067 (or 4029750065 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1112211010212 its reverse (2120101122111), we get a palindrome (3232312132323).
The spelling of 1112211010212 in words is "one trillion, one hundred twelve billion, two hundred eleven million, ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •