Base | Representation |
---|---|
bin | 101111000101101011… |
… | …0111110010011101011 |
3 | 100200000101110020211022 |
4 | 1132023112332103223 |
5 | 3124044302200321 |
6 | 114242133523055 |
7 | 10206622252346 |
oct | 1361326762353 |
9 | 320011406738 |
10 | 101122303211 |
11 | 399819a4116 |
12 | 177217a348b |
13 | 96c719bc97 |
14 | 4c7412745d |
15 | 296ca28dab |
hex | 178b5be4eb |
101122303211 has 8 divisors (see below), whose sum is σ = 104457713664. Its totient is φ = 97791480360.
The previous prime is 101122303201. The next prime is 101122303231. The reversal of 101122303211 is 112303221101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101122303211 - 26 = 101122303147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101122303211.
It is not an unprimeable number, because it can be changed into a prime (101122303201) 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 7 ways as a sum of consecutive naturals, for example, 1102061 + ... + 1190286.
It is an arithmetic number, because the mean of its divisors is an integer number (13057214208).
Almost surely, 2101122303211 is an apocalyptic number.
101122303211 is a deficient number, since it is larger than the sum of its proper divisors (3335410453).
101122303211 is a wasteful number, since it uses less digits than its factorization.
101122303211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2293801.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 101122303211 its reverse (112303221101), we get a palindrome (213425524312).
The spelling of 101122303211 in words is "one hundred one billion, one hundred twenty-two million, three hundred three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •