Base | Representation |
---|---|
bin | 11101101011111010101… |
… | …01110010010001101110 |
3 | 10121111211020222102221101 |
4 | 32311331111302101232 |
5 | 113202440042041420 |
6 | 2100330340353314 |
7 | 133456541620213 |
oct | 16657525622156 |
9 | 3544736872841 |
10 | 1020010112110 |
11 | 363647131330 |
12 | 1458273a583a |
13 | 75256aa4072 |
14 | 37523c01b0a |
15 | 1b7ed32d60a |
hex | ed7d57246e |
1020010112110 has 64 divisors (see below), whose sum is σ = 2121182956224. Its totient is φ = 349022822400.
The previous prime is 1020010112101. The next prime is 1020010112113. The reversal of 1020010112110 is 112110100201.
It is a super-4 number, since 4×10200101121104 (a number of 49 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020010112113) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9507970 + ... + 9614650.
It is an arithmetic number, because the mean of its divisors is an integer number (33143483691).
Almost surely, 21020010112110 is an apocalyptic number.
1020010112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1020010112110 is an abundant number, since it is smaller than the sum of its proper divisors (1101172844114).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020010112110 is a wasteful number, since it uses less digits than its factorization.
1020010112110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111829.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1020010112110 its reverse (112110100201), we get a palindrome (1132120212311).
The spelling of 1020010112110 in words is "one trillion, twenty billion, ten million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •