Base | Representation |
---|---|
bin | 10101110010111001… |
… | …001010010010101001 |
3 | 2020101221210021210122 |
4 | 111302321022102221 |
5 | 340412010022330 |
6 | 14430111053025 |
7 | 1455635213561 |
oct | 256271122251 |
9 | 66357707718 |
10 | 23402423465 |
11 | 9a1a070143 |
12 | 4651511175 |
13 | 228c56b865 |
14 | 11c0123da1 |
15 | 91e8015e5 |
hex | 572e4a4a9 |
23402423465 has 8 divisors (see below), whose sum is σ = 29734844040. Its totient is φ = 17620648192.
The previous prime is 23402423453. The next prime is 23402423467. The reversal of 23402423465 is 56432420432.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 6138565801 + 17263857664 = 78349^2 + 131392^2 .
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-23402423465 is a prime.
It is not an unprimeable number, because it can be changed into a prime (23402423467) 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 in 7 ways as a sum of consecutive naturals, for example, 137661230 + ... + 137661399.
It is an arithmetic number, because the mean of its divisors is an integer number (3716855505).
Almost surely, 223402423465 is an apocalyptic number.
It is an amenable number.
23402423465 is a deficient number, since it is larger than the sum of its proper divisors (6332420575).
23402423465 is a wasteful number, since it uses less digits than its factorization.
23402423465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275322651.
The product of its (nonzero) digits is 138240, while the sum is 35.
Adding to 23402423465 its reverse (56432420432), we get a palindrome (79834843897).
The spelling of 23402423465 in words is "twenty-three billion, four hundred two million, four hundred twenty-three thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •