Base | Representation |
---|---|
bin | 10000001001111110011… |
… | …001001101011000101010 |
3 | 10221010200021202020210102 |
4 | 100021332121031120222 |
5 | 121142213324200020 |
6 | 2210010132345402 |
7 | 143132224100252 |
oct | 20117631153052 |
9 | 3833607666712 |
10 | 1110222100010 |
11 | 39892a483031 |
12 | 15b203175262 |
13 | 809027b9c6a |
14 | 3ba40d22962 |
15 | 1dd2d0d1475 |
hex | 1027e64d62a |
1110222100010 has 32 divisors (see below), whose sum is σ = 2067585989760. Its totient is φ = 428718213952.
The previous prime is 1110222099979. The next prime is 1110222100019. The reversal of 1110222100010 is 100012220111.
It is a super-2 number, since 2×11102221000102 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1110222099964 and 1110222100000.
It is not an unprimeable number, because it can be changed into a prime (1110222100019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1954397 + ... + 2457663.
It is an arithmetic number, because the mean of its divisors is an integer number (64612062180).
Almost surely, 21110222100010 is an apocalyptic number.
1110222100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1110222100010 is a deficient number, since it is larger than the sum of its proper divisors (957363889750).
1110222100010 is a wasteful number, since it uses less digits than its factorization.
1110222100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510910.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1110222100010 its reverse (100012220111), we get a palindrome (1210234320121).
The spelling of 1110222100010 in words is "one trillion, one hundred ten billion, two hundred twenty-two million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •