Base | Representation |
---|---|
bin | 10101011101011010… |
… | …110010101101100111 |
3 | 2012110211212001012210 |
4 | 111131122302231213 |
5 | 334142242003111 |
6 | 14330241014503 |
7 | 1444001652510 |
oct | 253532625547 |
9 | 65424761183 |
10 | 23042141031 |
11 | 9854762668 |
12 | 4570924433 |
13 | 2232a253a0 |
14 | 118833ba07 |
15 | 8ecd860a6 |
hex | 55d6b2b67 |
23042141031 has 32 divisors (see below), whose sum is σ = 38268357120. Its totient is φ = 12007649664.
The previous prime is 23042141027. The next prime is 23042141039. The reversal of 23042141031 is 13014124032.
It is not a de Polignac number, because 23042141031 - 22 = 23042141027 is a prime.
It is a super-2 number, since 2×230421410312 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 23042140989 and 23042141007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23042141039) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 485796 + ... + 531113.
It is an arithmetic number, because the mean of its divisors is an integer number (1195886160).
Almost surely, 223042141031 is an apocalyptic number.
23042141031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
23042141031 is a deficient number, since it is larger than the sum of its proper divisors (15226216089).
23042141031 is a wasteful number, since it uses less digits than its factorization.
23042141031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1017015.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 23042141031 its reverse (13014124032), we get a palindrome (36056265063).
The spelling of 23042141031 in words is "twenty-three billion, forty-two million, one hundred forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •