Base | Representation |
---|---|
bin | 1101101110111111110100… |
… | …01010111001110010010111 |
3 | 10221221021221010111100112102 |
4 | 12313133322022321302113 |
5 | 12424312411212022221 |
6 | 144122354145312315 |
7 | 6235013332045013 |
oct | 667377212716227 |
9 | 127837833440472 |
10 | 30202112220311 |
11 | 9694709a87679 |
12 | 347945633569b |
13 | 13b107c237615 |
14 | 765b0bbb9543 |
15 | 37595d8cb30b |
hex | 1b77fa2b9c97 |
30202112220311 has 8 divisors (see below), whose sum is σ = 30670081885824. Its totient is φ = 29734648198200.
The previous prime is 30202112220307. The next prime is 30202112220359. The reversal of 30202112220311 is 11302221120203.
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 30202112220311 - 22 = 30202112220307 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30202112250311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 126290465 + ... + 126529386.
It is an arithmetic number, because the mean of its divisors is an integer number (3833760235728).
Almost surely, 230202112220311 is an apocalyptic number.
30202112220311 is a deficient number, since it is larger than the sum of its proper divisors (467969665513).
30202112220311 is a wasteful number, since it uses less digits than its factorization.
30202112220311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252821701.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 30202112220311 its reverse (11302221120203), we get a palindrome (41504333340514).
The spelling of 30202112220311 in words is "thirty trillion, two hundred two billion, one hundred twelve million, two hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •