Base | Representation |
---|---|
bin | 10111000010001000111011… |
… | …110011111100000010000111 |
3 | 111021200101102200011110102012 |
4 | 113002020323303330002013 |
5 | 101234213201120130224 |
6 | 555241313202004435 |
7 | 30223556345405312 |
oct | 2702107363740207 |
9 | 437611380143365 |
10 | 101302102114439 |
11 | 2a306a86781026 |
12 | b44103904671b |
13 | 446a9938bb785 |
14 | 1b03095637979 |
15 | baa17802880e |
hex | 5c223bcfc087 |
101302102114439 has 2 divisors, whose sum is σ = 101302102114440. Its totient is φ = 101302102114438.
The previous prime is 101302102114363. The next prime is 101302102114463. The reversal of 101302102114439 is 934411201203101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101302102114439 - 232 = 101297807147143 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101302105114439) 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 as a sum of consecutive naturals, namely, 50651051057219 + 50651051057220.
It is an arithmetic number, because the mean of its divisors is an integer number (50651051057220).
Almost surely, 2101302102114439 is an apocalyptic number.
101302102114439 is a deficient number, since it is larger than the sum of its proper divisors (1).
101302102114439 is an equidigital number, since it uses as much as digits as its factorization.
101302102114439 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 101302102114439 in words is "one hundred one trillion, three hundred two billion, one hundred two million, one hundred fourteen thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •