Base | Representation |
---|---|
bin | 1101101001110010011100… |
… | …00111100010111111100111 |
3 | 10221022011221200122010100102 |
4 | 12310321032013202333213 |
5 | 12413344333243001411 |
6 | 143504234134134315 |
7 | 6216046125220136 |
oct | 664711607427747 |
9 | 127264850563312 |
10 | 30023132000231 |
11 | 9625814349217 |
12 | 344a8261b139b |
13 | 139a227967456 |
14 | 75b1ad5d991d |
15 | 370e859aed3b |
hex | 1b4e4e1e2fe7 |
30023132000231 has 4 divisors (see below), whose sum is σ = 30023163588600. Its totient is φ = 30023100411864.
The previous prime is 30023132000143. The next prime is 30023132000243. The reversal of 30023132000231 is 13200023132003.
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 30023132000231 - 230 = 30022058258407 is a prime.
It is a super-2 number, since 2×300231320002312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30023132000431) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14322821 + ... + 16284638.
It is an arithmetic number, because the mean of its divisors is an integer number (7505790897150).
Almost surely, 230023132000231 is an apocalyptic number.
30023132000231 is a deficient number, since it is larger than the sum of its proper divisors (31588369).
30023132000231 is an equidigital number, since it uses as much as digits as its factorization.
30023132000231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31588368.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 30023132000231 its reverse (13200023132003), we get a palindrome (43223155132234).
The spelling of 30023132000231 in words is "thirty trillion, twenty-three billion, one hundred thirty-two million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •