Base | Representation |
---|---|
bin | 1101101001101110111001… |
… | …10000110011000011110001 |
3 | 10221022000001011002020101211 |
4 | 12310313130300303003301 |
5 | 12413331434413230223 |
6 | 143503321320200121 |
7 | 6215651033250055 |
oct | 664673460630361 |
9 | 127260034066354 |
10 | 30021230211313 |
11 | 9624a28891040 |
12 | 344a395309041 |
13 | 1399cb3958573 |
14 | 75b06cbc7c65 |
15 | 370dc3a4bd0d |
hex | 1b4ddcc330f1 |
30021230211313 has 8 divisors (see below), whose sum is σ = 33145016488416. Its totient is φ = 26963207856000.
The previous prime is 30021230211251. The next prime is 30021230211367. The reversal of 30021230211313 is 31311203212003.
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 30021230211313 - 213 = 30021230203121 is a prime.
It is a super-3 number, since 3×300212302113133 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30021230211113) 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, 16440979488 + ... + 16440981313.
It is an arithmetic number, because the mean of its divisors is an integer number (4143127061052).
Almost surely, 230021230211313 is an apocalyptic number.
It is an amenable number.
30021230211313 is a deficient number, since it is larger than the sum of its proper divisors (3123786277103).
30021230211313 is a wasteful number, since it uses less digits than its factorization.
30021230211313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32881960895.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30021230211313 its reverse (31311203212003), we get a palindrome (61332433423316).
The spelling of 30021230211313 in words is "thirty trillion, twenty-one billion, two hundred thirty million, two hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •