Base | Representation |
---|---|
bin | 101111000101011010… |
… | …0010010100010001101 |
3 | 100122222202100022200112 |
4 | 1132022310102202031 |
5 | 3124034440223041 |
6 | 114241211005405 |
7 | 10206452053454 |
oct | 1361264224215 |
9 | 318882308615 |
10 | 101113211021 |
11 | 39977854009 |
12 | 1771a739865 |
13 | 96c53376a4 |
14 | 4c72c3bb9b |
15 | 296bd2edeb |
hex | 178ad1288d |
101113211021 has 8 divisors (see below), whose sum is σ = 104622913920. Its totient is φ = 97605044208.
The previous prime is 101113211011. The next prime is 101113211027. The reversal of 101113211021 is 120112311101.
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 101113211021 - 218 = 101112948877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101113210987 and 101113211005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101113211027) 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, 249281 + ... + 514166.
It is an arithmetic number, because the mean of its divisors is an integer number (13077864240).
Almost surely, 2101113211021 is an apocalyptic number.
It is an amenable number.
101113211021 is a deficient number, since it is larger than the sum of its proper divisors (3509702899).
101113211021 is an equidigital number, since it uses as much as digits as its factorization.
101113211021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 768043.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 101113211021 its reverse (120112311101), we get a palindrome (221225522122).
The spelling of 101113211021 in words is "one hundred one billion, one hundred thirteen million, two hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •