Base | Representation |
---|---|
bin | 1000101110110101010… |
… | …10110100110101111001 |
3 | 1001200102000012102010212 |
4 | 10113122222310311321 |
5 | 14403420434344001 |
6 | 345454455520505 |
7 | 30450544563635 |
oct | 4273252646571 |
9 | 1050360172125 |
10 | 300021403001 |
11 | 106269295731 |
12 | 4a190689135 |
13 | 223a43b37c8 |
14 | 10741d13dc5 |
15 | 7c0e4da7bb |
hex | 45daab4d79 |
300021403001 has 4 divisors (see below), whose sum is σ = 300030022500. Its totient is φ = 300012783504.
The previous prime is 300021402953. The next prime is 300021403007. The reversal of 300021403001 is 100304120003.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100304120003 = 154573 ⋅648911.
It can be written as a sum of positive squares in 2 ways, for example, as 42693477376 + 257327925625 = 206624^2 + 507275^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-300021403001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (300021403007) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4257326 + ... + 4327223.
It is an arithmetic number, because the mean of its divisors is an integer number (75007505625).
Almost surely, 2300021403001 is an apocalyptic number.
It is an amenable number.
300021403001 is a deficient number, since it is larger than the sum of its proper divisors (8619499).
300021403001 is an equidigital number, since it uses as much as digits as its factorization.
300021403001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8619498.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 300021403001 its reverse (100304120003), we get a palindrome (400325523004).
The spelling of 300021403001 in words is "three hundred billion, twenty-one million, four hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.047 sec. • engine limits •