Base | Representation |
---|---|
bin | 11100000011011010… |
… | …010110011001110111 |
3 | 2212202020212122221120 |
4 | 130003122112121313 |
5 | 443142213311411 |
6 | 21500551115023 |
7 | 2114310601545 |
oct | 340332263167 |
9 | 85666778846 |
10 | 30122010231 |
11 | 118580a9135 |
12 | 5a07972a73 |
13 | 2ac0743cc1 |
14 | 165a728d95 |
15 | bb46ca106 |
hex | 703696677 |
30122010231 has 4 divisors (see below), whose sum is σ = 40162680312. Its totient is φ = 20081340152.
The previous prime is 30122010229. The next prime is 30122010277. The reversal of 30122010231 is 13201022103.
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 30122010231 - 21 = 30122010229 is a prime.
It is a super-2 number, since 2×301220102312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30122010231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30122010211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5020335036 + ... + 5020335041.
It is an arithmetic number, because the mean of its divisors is an integer number (10040670078).
Almost surely, 230122010231 is an apocalyptic number.
30122010231 is a deficient number, since it is larger than the sum of its proper divisors (10040670081).
30122010231 is a wasteful number, since it uses less digits than its factorization.
30122010231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10040670080.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 30122010231 its reverse (13201022103), we get a palindrome (43323032334).
The spelling of 30122010231 in words is "thirty billion, one hundred twenty-two million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •