Base | Representation |
---|---|
bin | 101111000101010101… |
… | …1111011110111001001 |
3 | 100122222121020001112200 |
4 | 1132022223323313021 |
5 | 3124033410133001 |
6 | 114241052030413 |
7 | 10206424332534 |
oct | 1361253736711 |
9 | 318877201480 |
10 | 101111021001 |
11 | 39976598681 |
12 | 17719a62409 |
13 | 96c4a4b913 |
14 | 4c7282ba1b |
15 | 296ba4b086 |
hex | 178aafbdc9 |
101111021001 has 12 divisors (see below), whose sum is σ = 146057878512. Its totient is φ = 67403366136.
The previous prime is 101111020973. The next prime is 101111021029. The reversal of 101111021001 is 100120111101.
It is an interprime number because it is at equal distance from previous prime (101111020973) and next prime (101111021029).
It is not a de Polignac number, because 101111021001 - 218 = 101110758857 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101111021101) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 166591 + ... + 479556.
It is an arithmetic number, because the mean of its divisors is an integer number (12171489876).
Almost surely, 2101111021001 is an apocalyptic number.
It is an amenable number.
101111021001 is a deficient number, since it is larger than the sum of its proper divisors (44946857511).
101111021001 is a wasteful number, since it uses less digits than its factorization.
101111021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663540 (or 663537 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101111021001 its reverse (100120111101), we get a palindrome (201231132102).
The spelling of 101111021001 in words is "one hundred one billion, one hundred eleven million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •