Base | Representation |
---|---|
bin | 101111000010110000… |
… | …0000001101011100111 |
3 | 100122202112111121001021 |
4 | 1132011200001223213 |
5 | 3123344121404111 |
6 | 114224303112011 |
7 | 10204316641144 |
oct | 1360540015347 |
9 | 318675447037 |
10 | 101024013031 |
11 | 39931470267 |
12 | 176b48a2607 |
13 | 96aca06806 |
14 | 4c6505d3cb |
15 | 29640b0d71 |
hex | 1785801ae7 |
101024013031 has 2 divisors, whose sum is σ = 101024013032. Its totient is φ = 101024013030.
The previous prime is 101024013001. The next prime is 101024013067. The reversal of 101024013031 is 130310420101.
It is a weak prime.
It is an emirp because it is prime and its reverse (130310420101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101024013031 - 231 = 98876529383 is a prime.
It is a super-2 number, since 2×1010240130312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101024012996 and 101024013014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101024013001) 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 as a sum of consecutive naturals, namely, 50512006515 + 50512006516.
It is an arithmetic number, because the mean of its divisors is an integer number (50512006516).
Almost surely, 2101024013031 is an apocalyptic number.
101024013031 is a deficient number, since it is larger than the sum of its proper divisors (1).
101024013031 is an equidigital number, since it uses as much as digits as its factorization.
101024013031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 101024013031 its reverse (130310420101), we get a palindrome (231334433132).
The spelling of 101024013031 in words is "one hundred one billion, twenty-four million, thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •