Base | Representation |
---|---|
bin | 10111000110100000100111… |
… | …000111100010000101100111 |
3 | 111022202002120010120210001012 |
4 | 113012200213013202011213 |
5 | 101304123210033441411 |
6 | 1000031255512252435 |
7 | 30254350152640313 |
oct | 2706404707420547 |
9 | 438662503523035 |
10 | 101602402640231 |
11 | 2a412378580849 |
12 | b48b2870a111b |
13 | 44900b0a7059c |
14 | 1b13822648b43 |
15 | bb2da1c9c18b |
hex | 5c68271e2167 |
101602402640231 has 2 divisors, whose sum is σ = 101602402640232. Its totient is φ = 101602402640230.
The previous prime is 101602402640209. The next prime is 101602402640237. The reversal of 101602402640231 is 132046204206101.
It is a strong prime.
It is an emirp because it is prime and its reverse (132046204206101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101602402640231 - 214 = 101602402623847 is a prime.
It is a super-2 number, since 2×1016024026402312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101602402640237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50801201320115 + 50801201320116.
It is an arithmetic number, because the mean of its divisors is an integer number (50801201320116).
Almost surely, 2101602402640231 is an apocalyptic number.
101602402640231 is a deficient number, since it is larger than the sum of its proper divisors (1).
101602402640231 is an equidigital number, since it uses as much as digits as its factorization.
101602402640231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 101602402640231 its reverse (132046204206101), we get a palindrome (233648606846332).
The spelling of 101602402640231 in words is "one hundred one trillion, six hundred two billion, four hundred two million, six hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •