Base | Representation |
---|---|
bin | 1101110001111001111000… |
… | …00101000000101111101101 |
3 | 10222021211202122011002202000 |
4 | 12320330330011000233231 |
5 | 12432432000032020023 |
6 | 144240314142522513 |
7 | 6245150602040646 |
oct | 670747405005755 |
9 | 128254678132660 |
10 | 30302002220013 |
11 | 9723009310937 |
12 | 3494893296439 |
13 | 13ba60b011814 |
14 | 76a8a63a46cd |
15 | 378358138243 |
hex | 1b8f3c140bed |
30302002220013 has 32 divisors (see below), whose sum is σ = 44965135564800. Its totient is φ = 20168361687600.
The previous prime is 30302002219967. The next prime is 30302002220047. The reversal of 30302002220013 is 31002220020303.
It is a happy number.
It is not a de Polignac number, because 30302002220013 - 212 = 30302002215917 is a prime.
It is a super-3 number, since 3×303020022200133 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30302002220813) 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, 675170908 + ... + 675215786.
It is an arithmetic number, because the mean of its divisors is an integer number (1405160486400).
Almost surely, 230302002220013 is an apocalyptic number.
It is an amenable number.
30302002220013 is a deficient number, since it is larger than the sum of its proper divisors (14663133344787).
30302002220013 is a wasteful number, since it uses less digits than its factorization.
30302002220013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85150 (or 85144 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 30302002220013 its reverse (31002220020303), we get a palindrome (61304222240316).
The spelling of 30302002220013 in words is "thirty trillion, three hundred two billion, two million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •