Base | Representation |
---|---|
bin | 10111000011100110011100… |
… | …101001111111010101110111 |
3 | 111022000222121100110200011102 |
4 | 113003212130221333111313 |
5 | 101242334320323104221 |
6 | 555355400500000315 |
7 | 30234042520154606 |
oct | 2703463451772567 |
9 | 438028540420142 |
10 | 101402511144311 |
11 | 2a345621a8a343 |
12 | b45859b99009b |
13 | 44772a6081910 |
14 | 1b07c9cb2da3d |
15 | bacaa310c30b |
hex | 5c399ca7f577 |
101402511144311 has 32 divisors (see below), whose sum is σ = 112564219595520. Its totient is φ = 90758314819584.
The previous prime is 101402511144301. The next prime is 101402511144343. The reversal of 101402511144311 is 113441115204101.
It is a cyclic number.
It is not a de Polignac number, because 101402511144311 - 222 = 101402506950007 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101402511144301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 524237231 + ... + 524430623.
It is an arithmetic number, because the mean of its divisors is an integer number (3517631862360).
Almost surely, 2101402511144311 is an apocalyptic number.
101402511144311 is a deficient number, since it is larger than the sum of its proper divisors (11161708451209).
101402511144311 is a wasteful number, since it uses less digits than its factorization.
101402511144311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201435.
The product of its (nonzero) digits is 1920, while the sum is 29.
Adding to 101402511144311 its reverse (113441115204101), we get a palindrome (214843626348412).
The spelling of 101402511144311 in words is "one hundred one trillion, four hundred two billion, five hundred eleven million, one hundred forty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •