Base | Representation |
---|---|
bin | 10101110011000000… |
… | …011100000110100110 |
3 | 2020102002101020001000 |
4 | 111303000130012212 |
5 | 340413002101210 |
6 | 14430220014130 |
7 | 1455660351264 |
oct | 256300340646 |
9 | 66362336030 |
10 | 23404331430 |
11 | 9a20153677 |
12 | 4652091346 |
13 | 228ca8912c |
14 | 11c049d434 |
15 | 91ea7bac0 |
hex | 57301c1a6 |
23404331430 has 32 divisors (see below), whose sum is σ = 62411551200. Its totient is φ = 6241154976.
The previous prime is 23404331429. The next prime is 23404331437. The reversal of 23404331430 is 3413340432.
23404331430 is a `hidden beast` number, since 2 + 340 + 4 + 3 + 314 + 3 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 23404331394 and 23404331403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23404331437) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43341085 + ... + 43341624.
It is an arithmetic number, because the mean of its divisors is an integer number (1950360975).
Almost surely, 223404331430 is an apocalyptic number.
23404331430 is an abundant number, since it is smaller than the sum of its proper divisors (39007219770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23404331430 is a wasteful number, since it uses less digits than its factorization.
23404331430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86682725 (or 86682719 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 23404331430 its reverse (3413340432), we get a palindrome (26817671862).
The spelling of 23404331430 in words is "twenty-three billion, four hundred four million, three hundred thirty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •