Base | Representation |
---|---|
bin | 10101011101010010… |
… | …101101011011010111 |
3 | 2012110200212101202201 |
4 | 111131102231123113 |
5 | 334141221202411 |
6 | 14330123345331 |
7 | 1443644646322 |
oct | 253522553327 |
9 | 65420771681 |
10 | 23040022231 |
11 | 9853545796 |
12 | 4570082247 |
13 | 2232462b65 |
14 | 1187d497b9 |
15 | 8ecab83c1 |
hex | 55d4ad6d7 |
23040022231 has 8 divisors (see below), whose sum is σ = 25307118720. Its totient is φ = 20878372152.
The previous prime is 23040022223. The next prime is 23040022237. The reversal of 23040022231 is 13222004032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23040022231 - 23 = 23040022223 is a prime.
It is a super-2 number, since 2×230400222312 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23040022199 and 23040022208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23040022237) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26361145 + ... + 26362018.
It is an arithmetic number, because the mean of its divisors is an integer number (3163389840).
Almost surely, 223040022231 is an apocalyptic number.
23040022231 is a deficient number, since it is larger than the sum of its proper divisors (2267096489).
23040022231 is a wasteful number, since it uses less digits than its factorization.
23040022231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52723205.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 23040022231 its reverse (13222004032), we get a palindrome (36262026263).
The spelling of 23040022231 in words is "twenty-three billion, forty million, twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •