Base | Representation |
---|---|
bin | 10111000010010001010000… |
… | …001001000010011000111011 |
3 | 111021201020111002102202220022 |
4 | 113002101100021002120323 |
5 | 101234334443434440121 |
6 | 555245351320321055 |
7 | 30224323562630255 |
oct | 2702212011023073 |
9 | 437636432382808 |
10 | 101311033124411 |
11 | 2a30a84a031000 |
12 | b44291001318b |
13 | 446b787c94b66 |
14 | 1b036a1810cd5 |
15 | baa4ec128aab |
hex | 5c245024263b |
101311033124411 has 16 divisors (see below), whose sum is σ = 114026025429888. Its totient is φ = 89959056846120.
The previous prime is 101311033124401. The next prime is 101311033124419. The reversal of 101311033124411 is 114421330113101.
It is a happy number.
It is not a de Polignac number, because 101311033124411 - 26 = 101311033124347 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101311033124419) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 885018101 + ... + 885132566.
It is an arithmetic number, because the mean of its divisors is an integer number (7126626589368).
Almost surely, 2101311033124411 is an apocalyptic number.
101311033124411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101311033124411 is a deficient number, since it is larger than the sum of its proper divisors (12714992305477).
101311033124411 is an equidigital number, since it uses as much as digits as its factorization.
101311033124411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1770150743 (or 1770150721 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 26.
Adding to 101311033124411 its reverse (114421330113101), we get a palindrome (215732363237512).
The spelling of 101311033124411 in words is "one hundred one trillion, three hundred eleven billion, thirty-three million, one hundred twenty-four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •