Base | Representation |
---|---|
bin | 10101101100111110… |
… | …011000110011011011 |
3 | 2020011000221200020011 |
4 | 111230332120303123 |
5 | 340211100132311 |
6 | 14412202542351 |
7 | 1453321224325 |
oct | 255476306333 |
9 | 66130850204 |
10 | 23303130331 |
11 | 99790117a8 |
12 | 46242079b7 |
13 | 2274b14a20 |
14 | 11b0c78615 |
15 | 915c3b321 |
hex | 56cf98cdb |
23303130331 has 8 divisors (see below), whose sum is σ = 25099112304. Its totient is φ = 21507638880.
The previous prime is 23303130289. The next prime is 23303130337. The reversal of 23303130331 is 13303130332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23303130331 - 29 = 23303129819 is a prime.
It is a super-2 number, since 2×233031303312 (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 (23303130337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20821 + ... + 216886.
It is an arithmetic number, because the mean of its divisors is an integer number (3137389038).
Almost surely, 223303130331 is an apocalyptic number.
23303130331 is a deficient number, since it is larger than the sum of its proper divisors (1795981973).
23303130331 is a wasteful number, since it uses less digits than its factorization.
23303130331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245261.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 23303130331 its reverse (13303130332), we get a palindrome (36606260663).
Subtracting from 23303130331 its reverse (13303130332), we obtain a palindrome (9999999999).
It can be divided in two parts, 233031 and 30331, that added together give a palindrome (263362).
The spelling of 23303130331 in words is "twenty-three billion, three hundred three million, one hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •