Base | Representation |
---|---|
bin | 1101101001001011011110… |
… | …00101101011001011101011 |
3 | 10221020011221121210201001201 |
4 | 12310211233011223023223 |
5 | 12413024011320234011 |
6 | 143450454122025031 |
7 | 6214405511663146 |
oct | 664455705531353 |
9 | 127204847721051 |
10 | 30002210321131 |
11 | 9617958630034 |
12 | 3446767648177 |
13 | 1398272345689 |
14 | 75a186b5305d |
15 | 37065dd83cc1 |
hex | 1b496f16b2eb |
30002210321131 has 32 divisors (see below), whose sum is σ = 32059224912960. Its totient is φ = 27978860642304.
The previous prime is 30002210321123. The next prime is 30002210321183. The reversal of 30002210321131 is 13112301220003.
It is a cyclic number.
It is not a de Polignac number, because 30002210321131 - 23 = 30002210321123 is a prime.
It is a super-2 number, since 2×300022103211312 (a number of 28 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 = 30002210321099 and 30002210321108.
It is not an unprimeable number, because it can be changed into a prime (30002210301131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2106445896 + ... + 2106460138.
It is an arithmetic number, because the mean of its divisors is an integer number (1001850778530).
Almost surely, 230002210321131 is an apocalyptic number.
30002210321131 is a deficient number, since it is larger than the sum of its proper divisors (2057014591829).
30002210321131 is a wasteful number, since it uses less digits than its factorization.
30002210321131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16815.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 30002210321131 its reverse (13112301220003), we get a palindrome (43114511541134).
The spelling of 30002210321131 in words is "thirty trillion, two billion, two hundred ten million, three hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •