Base | Representation |
---|---|
bin | 10101101110001010… |
… | …001110110000100011 |
3 | 2020012102100202221010 |
4 | 111232022032300203 |
5 | 340231142342011 |
6 | 14414153032003 |
7 | 1453652221626 |
oct | 255612166043 |
9 | 66172322833 |
10 | 23323012131 |
11 | 9989261241 |
12 | 462a9b5603 |
13 | 2278c863c3 |
14 | 11b3771dbd |
15 | 9178671a6 |
hex | 56e28ec23 |
23323012131 has 4 divisors (see below), whose sum is σ = 31097349512. Its totient is φ = 15548674752.
The previous prime is 23323012109. The next prime is 23323012151. The reversal of 23323012131 is 13121032332.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 23323012131 - 231 = 21175528483 is a prime.
It is a super-2 number, since 2×233230121312 (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 = 23323012098 and 23323012107.
It is not an unprimeable number, because it can be changed into a prime (23323012151) 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, 3887168686 + ... + 3887168691.
It is an arithmetic number, because the mean of its divisors is an integer number (7774337378).
Almost surely, 223323012131 is an apocalyptic number.
23323012131 is a deficient number, since it is larger than the sum of its proper divisors (7774337381).
23323012131 is an equidigital number, since it uses as much as digits as its factorization.
23323012131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7774337380.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 23323012131 its reverse (13121032332), we get a palindrome (36444044463).
The spelling of 23323012131 in words is "twenty-three billion, three hundred twenty-three million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •