Base | Representation |
---|---|
bin | 11011111101111100… |
… | …001010011111010111 |
3 | 2212111212010210010012 |
4 | 123331330022133113 |
5 | 443000213223111 |
6 | 21443511350435 |
7 | 2112114403442 |
oct | 337574123727 |
9 | 85455123105 |
10 | 30030211031 |
11 | 118102a9027 |
12 | 59a108241b |
13 | 2aa7712152 |
14 | 164c470659 |
15 | bab5e548b |
hex | 6fdf0a7d7 |
30030211031 has 4 divisors (see below), whose sum is σ = 30053259312. Its totient is φ = 30007162752.
The previous prime is 30030210979. The next prime is 30030211033. The reversal of 30030211031 is 13011203003.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13011203003 = 139 ⋅93605777.
It is a cyclic number.
It is not a de Polignac number, because 30030211031 - 218 = 30029948887 is a prime.
It is a super-2 number, since 2×300302110312 (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 = 30030210997 and 30030211015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30030211033) 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, 11522186 + ... + 11524791.
It is an arithmetic number, because the mean of its divisors is an integer number (7513314828).
Almost surely, 230030211031 is an apocalyptic number.
30030211031 is a deficient number, since it is larger than the sum of its proper divisors (23048281).
30030211031 is a wasteful number, since it uses less digits than its factorization.
30030211031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23048280.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 30030211031 its reverse (13011203003), we get a palindrome (43041414034).
The spelling of 30030211031 in words is "thirty billion, thirty million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •