Base | Representation |
---|---|
bin | 101111001000010101… |
… | …0011110110110001111 |
3 | 100200020120220221000022 |
4 | 1132100222132312033 |
5 | 3124240043201221 |
6 | 114255033252355 |
7 | 10212052612016 |
oct | 1362052366617 |
9 | 320216827008 |
10 | 101211303311 |
11 | 39a18162218 |
12 | 177475640bb |
13 | 970c760a71 |
14 | 4c81c93a7d |
15 | 29757594ab |
hex | 1790a9ed8f |
101211303311 has 8 divisors (see below), whose sum is σ = 101597230800. Its totient is φ = 100826021440.
The previous prime is 101211303287. The next prime is 101211303329. The reversal of 101211303311 is 113303112101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101211303311 is a prime.
It is a super-2 number, since 2×1012113033112 (a number of 23 digits) contains 22 as substring.
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 101211303311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101211303341) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 153896 + ... + 475506.
It is an arithmetic number, because the mean of its divisors is an integer number (12699653850).
Almost surely, 2101211303311 is an apocalyptic number.
101211303311 is a deficient number, since it is larger than the sum of its proper divisors (385927489).
101211303311 is an equidigital number, since it uses as much as digits as its factorization.
101211303311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322809.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 101211303311 its reverse (113303112101), we get a palindrome (214514415412).
The spelling of 101211303311 in words is "one hundred one billion, two hundred eleven million, three hundred three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •