Base | Representation |
---|---|
bin | 1101101001011111101000… |
… | …00011101011011100001101 |
3 | 10221021012212202000100011201 |
4 | 12310233310003223130031 |
5 | 12413213141430232341 |
6 | 143455443544545501 |
7 | 6215240614052656 |
oct | 664576403533415 |
9 | 127235782010151 |
10 | 30013031102221 |
11 | 962150068a022 |
12 | 3448887482291 |
13 | 13992a80b081b |
14 | 75a8d1cd052d |
15 | 370a93d21331 |
hex | 1b4bf40eb70d |
30013031102221 has 8 divisors (see below), whose sum is σ = 30197928813920. Its totient is φ = 29828142765072.
The previous prime is 30013031102191. The next prime is 30013031102303. The reversal of 30013031102221 is 12220113031003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30013031102221 - 229 = 30012494231309 is a prime.
It is a super-2 number, since 2×300130311022212 (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 (30013031102321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4134151 + ... + 8781643.
It is an arithmetic number, because the mean of its divisors is an integer number (3774741101740).
Almost surely, 230013031102221 is an apocalyptic number.
It is an amenable number.
30013031102221 is a deficient number, since it is larger than the sum of its proper divisors (184897711699).
30013031102221 is a wasteful number, since it uses less digits than its factorization.
30013031102221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4687275.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 30013031102221 its reverse (12220113031003), we get a palindrome (42233144133224).
The spelling of 30013031102221 in words is "thirty trillion, thirteen billion, thirty-one million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •