Base | Representation |
---|---|
bin | 1101101001001011011110… |
… | …01000010110010111011101 |
3 | 10221020011221200010022212222 |
4 | 12310211233020112113131 |
5 | 12413024012010203201 |
6 | 143450454145035125 |
7 | 6214405520643320 |
oct | 664455710262735 |
9 | 127204850108788 |
10 | 30002211022301 |
11 | 9617958a69911 |
12 | 3446767925aa5 |
13 | 139827252c87b |
14 | 75a186c967b7 |
15 | 37065de7191b |
hex | 1b496f2165dd |
30002211022301 has 8 divisors (see below), whose sum is σ = 35470594312320. Its totient is φ = 24829416018288.
The previous prime is 30002211022241. The next prime is 30002211022387. The reversal of 30002211022301 is 10322011220003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30002211022301 - 26 = 30002211022237 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30002211022301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30002211021301) 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, 73897071281 + ... + 73897071686.
It is an arithmetic number, because the mean of its divisors is an integer number (4433824289040).
Almost surely, 230002211022301 is an apocalyptic number.
It is an amenable number.
30002211022301 is a deficient number, since it is larger than the sum of its proper divisors (5468383290019).
30002211022301 is a wasteful number, since it uses less digits than its factorization.
30002211022301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147794143003.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 30002211022301 its reverse (10322011220003), we get a palindrome (40324222242304).
The spelling of 30002211022301 in words is "thirty trillion, two billion, two hundred eleven million, twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •