Base | Representation |
---|---|
bin | 10101101000001101… |
… | …001101110001001101 |
3 | 2012221110102022001212 |
4 | 111220031031301031 |
5 | 340030110144323 |
6 | 14400224144205 |
7 | 1451330233622 |
oct | 255015156115 |
9 | 65843368055 |
10 | 23223131213 |
11 | 9937941227 |
12 | 4601468065 |
13 | 2261384b79 |
14 | 11a43b2349 |
15 | 90dbd7b78 |
hex | 56834dc4d |
23223131213 has 4 divisors (see below), whose sum is σ = 23296390620. Its totient is φ = 23149871808.
The previous prime is 23223131201. The next prime is 23223131219. The reversal of 23223131213 is 31213132232.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13045751524 + 10177379689 = 114218^2 + 100883^2 .
It is a cyclic number.
It is not a de Polignac number, because 23223131213 - 26 = 23223131149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23223131219) 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, 36629228 + ... + 36629861.
It is an arithmetic number, because the mean of its divisors is an integer number (5824097655).
Almost surely, 223223131213 is an apocalyptic number.
It is an amenable number.
23223131213 is a deficient number, since it is larger than the sum of its proper divisors (73259407).
23223131213 is an equidigital number, since it uses as much as digits as its factorization.
23223131213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73259406.
The product of its digits is 1296, while the sum is 23.
Adding to 23223131213 its reverse (31213132232), we get a palindrome (54436263445).
The spelling of 23223131213 in words is "twenty-three billion, two hundred twenty-three million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •