Base | Representation |
---|---|
bin | 101111001110000111… |
… | …1110100011011101111 |
3 | 100200202010121021102102 |
4 | 1132130033310123233 |
5 | 3130134320443211 |
6 | 114330214445315 |
7 | 10216632502364 |
oct | 1363417643357 |
9 | 320663537372 |
10 | 101405640431 |
11 | 3a007927607 |
12 | 177a066383b |
13 | 9740ab4644 |
14 | 4c9da0046b |
15 | 2987845a3b |
hex | 179c3f46ef |
101405640431 has 4 divisors (see below), whose sum is σ = 101413689000. Its totient is φ = 101397591864.
The previous prime is 101405640397. The next prime is 101405640437. The reversal of 101405640431 is 134046504101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 134046504101 = 71 ⋅1887978931.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101405640431 is a prime.
It is a super-2 number, since 2×1014056404312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101405640394 and 101405640403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101405640437) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4005356 + ... + 4030593.
It is an arithmetic number, because the mean of its divisors is an integer number (25353422250).
Almost surely, 2101405640431 is an apocalyptic number.
101405640431 is a deficient number, since it is larger than the sum of its proper divisors (8048569).
101405640431 is an equidigital number, since it uses as much as digits as its factorization.
101405640431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8048568.
The product of its (nonzero) digits is 5760, while the sum is 29.
The spelling of 101405640431 in words is "one hundred one billion, four hundred five million, six hundred forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •