Base | Representation |
---|---|
bin | 1000101110110110101… |
… | …00000000110101010101 |
3 | 1001200102202111221212111 |
4 | 10113123110000311111 |
5 | 14403431220400041 |
6 | 345455523151021 |
7 | 30451035423061 |
oct | 4273324006525 |
9 | 1050382457774 |
10 | 300032200021 |
11 | 10627439a694 |
12 | 4a194215471 |
13 | 223a66c4088 |
14 | 10743524aa1 |
15 | 7c1041e981 |
hex | 45db500d55 |
300032200021 has 2 divisors, whose sum is σ = 300032200022. Its totient is φ = 300032200020.
The previous prime is 300032199991. The next prime is 300032200051. The reversal of 300032200021 is 120002230003.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (300032199991) and next prime (300032200051).
It can be written as a sum of positive squares in only one way, i.e., 193292122500 + 106740077521 = 439650^2 + 326711^2 .
It is a cyclic number.
It is not a de Polignac number, because 300032200021 - 27 = 300032199893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 300032199974 and 300032200010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (300032200051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 150016100010 + 150016100011.
It is an arithmetic number, because the mean of its divisors is an integer number (150016100011).
Almost surely, 2300032200021 is an apocalyptic number.
It is an amenable number.
300032200021 is a deficient number, since it is larger than the sum of its proper divisors (1).
300032200021 is an equidigital number, since it uses as much as digits as its factorization.
300032200021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 13.
Adding to 300032200021 its reverse (120002230003), we get a palindrome (420034430024).
The spelling of 300032200021 in words is "three hundred billion, thirty-two million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •