Base | Representation |
---|---|
bin | 10101101111001100… |
… | …101110010111111011 |
3 | 2020020122011100202201 |
4 | 111233030232113323 |
5 | 340300123140011 |
6 | 14420014411031 |
7 | 1454253331105 |
oct | 255714562773 |
9 | 66218140681 |
10 | 23340443131 |
11 | 9998087425 |
12 | 4634800a77 |
13 | 227c77a3c5 |
14 | 11b5bcc575 |
15 | 91915bcc1 |
hex | 56f32e5fb |
23340443131 has 12 divisors (see below), whose sum is σ = 25321723488. Its totient is φ = 21500070272.
The previous prime is 23340443117. The next prime is 23340443149. The reversal of 23340443131 is 13134404332.
It is not a de Polignac number, because 23340443131 - 25 = 23340443099 is a prime.
It is a super-2 number, since 2×233404431312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23340443131.
It is not an unprimeable number, because it can be changed into a prime (23340443831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 845596 + ... + 872761.
It is an arithmetic number, because the mean of its divisors is an integer number (2110143624).
Almost surely, 223340443131 is an apocalyptic number.
23340443131 is a deficient number, since it is larger than the sum of its proper divisors (1981280357).
23340443131 is a wasteful number, since it uses less digits than its factorization.
23340443131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1718438 (or 1718421 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 23340443131 its reverse (13134404332), we get a palindrome (36474847463).
The spelling of 23340443131 in words is "twenty-three billion, three hundred forty million, four hundred forty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •