Base | Representation |
---|---|
bin | 1101101001101110110110… |
… | …00001110111001011101111 |
3 | 10221021222222010100202122102 |
4 | 12310313123001313023233 |
5 | 12413331404442131343 |
6 | 143503314401005315 |
7 | 6215650231126412 |
oct | 664673301671357 |
9 | 127258863322572 |
10 | 30021201130223 |
11 | 9624a13428a86 |
12 | 344a38762383b |
13 | 1399caa915914 |
14 | 75b068db7b79 |
15 | 370dc12053b8 |
hex | 1b4ddb0772ef |
30021201130223 has 8 divisors (see below), whose sum is σ = 30522754493088. Its totient is φ = 29522088417024.
The previous prime is 30021201130171. The next prime is 30021201130279. The reversal of 30021201130223 is 32203110212003.
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 30021201130223 - 220 = 30021200081647 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30021201130195 and 30021201130204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30021201150223) 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, 610137611 + ... + 610186812.
It is an arithmetic number, because the mean of its divisors is an integer number (3815344311636).
Almost surely, 230021201130223 is an apocalyptic number.
30021201130223 is a deficient number, since it is larger than the sum of its proper divisors (501553362865).
30021201130223 is a wasteful number, since it uses less digits than its factorization.
30021201130223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1220324833.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 30021201130223 its reverse (32203110212003), we get a palindrome (62224311342226).
The spelling of 30021201130223 in words is "thirty trillion, twenty-one billion, two hundred one million, one hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •