Base | Representation |
---|---|
bin | 10101011100010110… |
… | …011001110110011001 |
3 | 2012102121010020010111 |
4 | 111130112121312121 |
5 | 334123144312101 |
6 | 14324400444321 |
7 | 1443363404410 |
oct | 253426316631 |
9 | 65377106114 |
10 | 23024213401 |
11 | 9845628342 |
12 | 45669196a1 |
13 | 222c0b9317 |
14 | 1185bd2477 |
15 | 8eb4e4251 |
hex | 55c599d99 |
23024213401 has 4 divisors (see below), whose sum is σ = 26313386752. Its totient is φ = 19735040052.
The previous prime is 23024213393. The next prime is 23024213417. The reversal of 23024213401 is 10431242032.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 23024213401 - 23 = 23024213393 is a prime.
It is a super-2 number, since 2×230242134012 (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 (23024213491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1644586665 + ... + 1644586678.
It is an arithmetic number, because the mean of its divisors is an integer number (6578346688).
Almost surely, 223024213401 is an apocalyptic number.
It is an amenable number.
23024213401 is a deficient number, since it is larger than the sum of its proper divisors (3289173351).
23024213401 is an equidigital number, since it uses as much as digits as its factorization.
23024213401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3289173350.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 23024213401 its reverse (10431242032), we get a palindrome (33455455433).
The spelling of 23024213401 in words is "twenty-three billion, twenty-four million, two hundred thirteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •