Base | Representation |
---|---|
bin | 101111001000100110… |
… | …0000100111010110001 |
3 | 100200021012111100112000 |
4 | 1132101030010322301 |
5 | 3124244322010001 |
6 | 114255550124213 |
7 | 10212220511343 |
oct | 1362114047261 |
9 | 320235440460 |
10 | 101220110001 |
11 | 39a2212787a |
12 | 1774a4b0669 |
13 | 971152541a |
14 | 4c83107293 |
15 | 29763e8a86 |
hex | 1791304eb1 |
101220110001 has 8 divisors (see below), whose sum is σ = 149955718560. Its totient is φ = 67480073316.
The previous prime is 101220109999. The next prime is 101220110039. The reversal of 101220110001 is 100011022101.
It is a happy number.
It is not a de Polignac number, because 101220110001 - 21 = 101220109999 is a prime.
It is a super-2 number, since 2×1012201100012 (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 not an unprimeable number, because it can be changed into a prime (101220110081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1874446455 + ... + 1874446508.
It is an arithmetic number, because the mean of its divisors is an integer number (18744464820).
Almost surely, 2101220110001 is an apocalyptic number.
It is an amenable number.
101220110001 is a deficient number, since it is larger than the sum of its proper divisors (48735608559).
101220110001 is an equidigital number, since it uses as much as digits as its factorization.
101220110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3748892972 (or 3748892966 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101220110001 its reverse (100011022101), we get a palindrome (201231132102).
The spelling of 101220110001 in words is "one hundred one billion, two hundred twenty million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •