Base | Representation |
---|---|
bin | 10000001001111110011… |
… | …001001101110111111100 |
3 | 10221010200021202100112120 |
4 | 100021332121031313330 |
5 | 121142213324231022 |
6 | 2210010132402540 |
7 | 143132224106142 |
oct | 20117631156774 |
9 | 3833607670476 |
10 | 1110222102012 |
11 | 39892a484591 |
12 | 15b203176450 |
13 | 809027bab4a |
14 | 3ba40d23592 |
15 | 1dd2d0d1d5c |
hex | 1027e64ddfc |
1110222102012 has 48 divisors (see below), whose sum is σ = 2592352667520. Its totient is φ = 369812089408.
The previous prime is 1110222101999. The next prime is 1110222102029. The reversal of 1110222102012 is 2102012220111.
It is a junction number, because it is equal to n+sod(n) for n = 1110222101982 and 1110222102000.
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, 147573283 + ... + 147580805.
It is an arithmetic number, because the mean of its divisors is an integer number (54007347240).
Almost surely, 21110222102012 is an apocalyptic number.
1110222102012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1110222102012 is an abundant number, since it is smaller than the sum of its proper divisors (1482130565508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110222102012 is a wasteful number, since it uses less digits than its factorization.
1110222102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14602 (or 14600 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1110222102012 its reverse (2102012220111), we get a palindrome (3212234322123).
The spelling of 1110222102012 in words is "one trillion, one hundred ten billion, two hundred twenty-two million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •