Base | Representation |
---|---|
bin | 10101011100010010… |
… | …100101101001001011 |
3 | 2012102112020102000110 |
4 | 111130102211221023 |
5 | 334122420310011 |
6 | 14324323205403 |
7 | 1443352040232 |
oct | 253422455113 |
9 | 65375212013 |
10 | 23023213131 |
11 | 9845004876 |
12 | 4566516863 |
13 | 222bb28c49 |
14 | 1185a11b19 |
15 | 8eb397ba6 |
hex | 55c4a5a4b |
23023213131 has 4 divisors (see below), whose sum is σ = 30697617512. Its totient is φ = 15348808752.
The previous prime is 23023213117. The next prime is 23023213133. The reversal of 23023213131 is 13131232032.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 23023213131 - 25 = 23023213099 is a prime.
It is a super-2 number, since 2×230232131312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23023213098 and 23023213107.
It is not an unprimeable number, because it can be changed into a prime (23023213133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3837202186 + ... + 3837202191.
It is an arithmetic number, because the mean of its divisors is an integer number (7674404378).
Almost surely, 223023213131 is an apocalyptic number.
23023213131 is a deficient number, since it is larger than the sum of its proper divisors (7674404381).
23023213131 is an equidigital number, since it uses as much as digits as its factorization.
23023213131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7674404380.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 23023213131 its reverse (13131232032), we get a palindrome (36154445163).
The spelling of 23023213131 in words is "twenty-three billion, twenty-three million, two hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •