Base | Representation |
---|---|
bin | 10101110010110100… |
… | …111111101011001001 |
3 | 2020101212201210202211 |
4 | 111302310333223021 |
5 | 340411220101101 |
6 | 14430031425121 |
7 | 1455623014660 |
oct | 256264775311 |
9 | 66355653684 |
10 | 23401331401 |
11 | 9a19494708 |
12 | 46510851a1 |
13 | 228c278776 |
14 | 11bdd1bdd7 |
15 | 91e687c51 |
hex | 572d3fac9 |
23401331401 has 8 divisors (see below), whose sum is σ = 27143549120. Its totient is φ = 19758906288.
The previous prime is 23401331389. The next prime is 23401331413. The reversal of 23401331401 is 10413310432.
It is an interprime number because it is at equal distance from previous prime (23401331389) and next prime (23401331413).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23401331401 is a prime.
It is a super-2 number, since 2×234013314012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23401331441) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24947646 + ... + 24948583.
It is an arithmetic number, because the mean of its divisors is an integer number (3392943640).
Almost surely, 223401331401 is an apocalyptic number.
It is an amenable number.
23401331401 is a deficient number, since it is larger than the sum of its proper divisors (3742217719).
23401331401 is an equidigital number, since it uses as much as digits as its factorization.
23401331401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49896303.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 23401331401 its reverse (10413310432), we get a palindrome (33814641833).
The spelling of 23401331401 in words is "twenty-three billion, four hundred one million, three hundred thirty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •