Base | Representation |
---|---|
bin | 101111001000010010… |
… | …1100011000111111111 |
3 | 100200020111111020002000 |
4 | 1132100211203013333 |
5 | 3124234230310421 |
6 | 114254545433343 |
7 | 10212035614530 |
oct | 1362045430777 |
9 | 320214436060 |
10 | 101210010111 |
11 | 39a17459661 |
12 | 1774703b853 |
13 | 970c3ca262 |
14 | 4c81a38687 |
15 | 29755a1226 |
hex | 17909631ff |
101210010111 has 16 divisors (see below), whose sum is σ = 171360864000. Its totient is φ = 57834291384.
The previous prime is 101210010101. The next prime is 101210010113. The reversal of 101210010111 is 111010012101.
It is not a de Polignac number, because 101210010111 - 26 = 101210010047 is a prime.
It is a super-2 number, since 2×1012100101112 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 101210010093 and 101210010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101210010113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 267751161 + ... + 267751538.
It is an arithmetic number, because the mean of its divisors is an integer number (10710054000).
Almost surely, 2101210010111 is an apocalyptic number.
101210010111 is a deficient number, since it is larger than the sum of its proper divisors (70150853889).
101210010111 is an equidigital number, since it uses as much as digits as its factorization.
101210010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 535502715 (or 535502709 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101210010111 its reverse (111010012101), we get a palindrome (212220022212).
The spelling of 101210010111 in words is "one hundred one billion, two hundred ten million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •