Base | Representation |
---|---|
bin | 1101101110111100101010… |
… | …10100011001110111111101 |
3 | 10221221010120012200102210010 |
4 | 12313132111110121313331 |
5 | 12424300430033242341 |
6 | 144121514223533433 |
7 | 6234623365156560 |
oct | 667362524316775 |
9 | 127833505612703 |
10 | 30200420212221 |
11 | 9693a20982986 |
12 | 347906375a279 |
13 | 13b0b6c8288bc |
14 | 7659cb1b44d7 |
15 | 3758b00a5716 |
hex | 1b7795519dfd |
30200420212221 has 16 divisors (see below), whose sum is σ = 46048112755200. Its totient is φ = 17246723673648.
The previous prime is 30200420212181. The next prime is 30200420212223. The reversal of 30200420212221 is 12221202400203.
It is not a de Polignac number, because 30200420212221 - 211 = 30200420210173 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30200420212223) 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 15 ways as a sum of consecutive naturals, for example, 444102891 + ... + 444170888.
It is an arithmetic number, because the mean of its divisors is an integer number (2878007047200).
Almost surely, 230200420212221 is an apocalyptic number.
It is an amenable number.
30200420212221 is a deficient number, since it is larger than the sum of its proper divisors (15847692542979).
30200420212221 is a wasteful number, since it uses less digits than its factorization.
30200420212221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 888275408.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 30200420212221 its reverse (12221202400203), we get a palindrome (42421622612424).
The spelling of 30200420212221 in words is "thirty trillion, two hundred billion, four hundred twenty million, two hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •