Base | Representation |
---|---|
bin | 11100001001010000… |
… | …001111010101011011 |
3 | 2220000002022020100222 |
4 | 130021100033111123 |
5 | 443342311220011 |
6 | 21514411550255 |
7 | 2116610646464 |
oct | 341120172533 |
9 | 86002266328 |
10 | 30220023131 |
11 | 118a8462731 |
12 | 5a3475b38b |
13 | 2b07b401bc |
14 | 166975dd6b |
15 | bbd0daddb |
hex | 70940f55b |
30220023131 has 4 divisors (see below), whose sum is σ = 30220810032. Its totient is φ = 30219236232.
The previous prime is 30220023101. The next prime is 30220023193. The reversal of 30220023131 is 13132002203.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13132002203 = 81281 ⋅161563.
It is a cyclic number.
It is not a de Polignac number, because 30220023131 - 234 = 13040153947 is a prime.
It is a super-2 number, since 2×302200231312 (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 (30220023101) 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, 332720 + ... + 413693.
It is an arithmetic number, because the mean of its divisors is an integer number (7555202508).
Almost surely, 230220023131 is an apocalyptic number.
30220023131 is a deficient number, since it is larger than the sum of its proper divisors (786901).
30220023131 is an equidigital number, since it uses as much as digits as its factorization.
30220023131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 786900.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 30220023131 its reverse (13132002203), we get a palindrome (43352025334).
The spelling of 30220023131 in words is "thirty billion, two hundred twenty million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •