Base | Representation |
---|---|
bin | 10101011100101101… |
… | …101000100100100011 |
3 | 2012110000120121111121 |
4 | 111130231220210203 |
5 | 334131224144021 |
6 | 14325135153111 |
7 | 1443466226362 |
oct | 253455504443 |
9 | 65400517447 |
10 | 23030303011 |
11 | 9849007581 |
12 | 4568975797 |
13 | 223043c041 |
14 | 11869397d9 |
15 | 8ebce8741 |
hex | 55cb68923 |
23030303011 has 4 divisors (see below), whose sum is σ = 23407849024. Its totient is φ = 22652757000.
The previous prime is 23030302957. The next prime is 23030303033. The reversal of 23030303011 is 11030303032.
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 23030303011 - 221 = 23028205859 is a prime.
It is a super-2 number, since 2×230303030112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23030303041) 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, 188772915 + ... + 188773036.
It is an arithmetic number, because the mean of its divisors is an integer number (5851962256).
Almost surely, 223030303011 is an apocalyptic number.
23030303011 is a deficient number, since it is larger than the sum of its proper divisors (377546013).
23030303011 is an equidigital number, since it uses as much as digits as its factorization.
23030303011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377546012.
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 23030303011 its reverse (11030303032), we get a palindrome (34060606043).
It can be divided in two parts, 23030 and 303011, that added together give a square (326041 = 5712).
The spelling of 23030303011 in words is "twenty-three billion, thirty million, three hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •