Base | Representation |
---|---|
bin | 10101110010111111… |
… | …010011110010001101 |
3 | 2020102001211011201000 |
4 | 111302333103302031 |
5 | 340412413111323 |
6 | 14430205410513 |
7 | 1455655005546 |
oct | 256277236215 |
9 | 66361734630 |
10 | 23404035213 |
11 | 9a1aa71069 |
12 | 4651b69a39 |
13 | 228c9b4360 |
14 | 11c04234cd |
15 | 91ea1de43 |
hex | 572fd3c8d |
23404035213 has 64 divisors (see below), whose sum is σ = 40660704000. Its totient is φ = 13173850368.
The previous prime is 23404035203. The next prime is 23404035223. The reversal of 23404035213 is 31253040432.
23404035213 is a `hidden beast` number, since 2 + 3 + 40 + 403 + 5 + 213 = 666.
It is an interprime number because it is at equal distance from previous prime (23404035203) and next prime (23404035223).
It is not a de Polignac number, because 23404035213 - 29 = 23404034701 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23404035203) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 132895 + ... + 253907.
It is an arithmetic number, because the mean of its divisors is an integer number (635323500).
Almost surely, 223404035213 is an apocalyptic number.
It is an amenable number.
23404035213 is a deficient number, since it is larger than the sum of its proper divisors (17256668787).
23404035213 is a wasteful number, since it uses less digits than its factorization.
23404035213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121083 (or 121077 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 27.
Adding to 23404035213 its reverse (31253040432), we get a palindrome (54657075645).
The spelling of 23404035213 in words is "twenty-three billion, four hundred four million, thirty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •