Base | Representation |
---|---|
bin | 10101011100101101… |
… | …101100111111101011 |
3 | 2012110000121112100201 |
4 | 111130231230333223 |
5 | 334131230234011 |
6 | 14325135413031 |
7 | 1443466333246 |
oct | 253455547753 |
9 | 65400545321 |
10 | 23030321131 |
11 | 984901a154 |
12 | 4568984177 |
13 | 223044736c |
14 | 118694225d |
15 | 8ebcedcc1 |
hex | 55cb6cfeb |
23030321131 has 4 divisors (see below), whose sum is σ = 23051866000. Its totient is φ = 23008776264.
The previous prime is 23030321129. The next prime is 23030321219. The reversal of 23030321131 is 13112303032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23030321131 - 21 = 23030321129 is a prime.
It is a super-2 number, since 2×230303211312 (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 = 23030321099 and 23030321108.
It is not an unprimeable number, because it can be changed into a prime (23030361131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10770831 + ... + 10772968.
It is an arithmetic number, because the mean of its divisors is an integer number (5762966500).
Almost surely, 223030321131 is an apocalyptic number.
23030321131 is a deficient number, since it is larger than the sum of its proper divisors (21544869).
23030321131 is a wasteful number, since it uses less digits than its factorization.
23030321131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21544868.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 23030321131 its reverse (13112303032), we get a palindrome (36142624163).
The spelling of 23030321131 in words is "twenty-three billion, thirty million, three hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •