Base | Representation |
---|---|
bin | 1101101001001001001111… |
… | …00110101000001011000001 |
3 | 10221020001212001001212202121 |
4 | 12310210213212220023001 |
5 | 12413014032304000001 |
6 | 143450135120244241 |
7 | 6214334006633116 |
oct | 664444746501301 |
9 | 127201761055677 |
10 | 30001011000001 |
11 | 96173a2648348 |
12 | 3446491a70681 |
13 | 1398110a2b1c2 |
14 | 75a0b175c90d |
15 | 3705dd92e6a1 |
hex | 1b49279a82c1 |
30001011000001 has 2 divisors, whose sum is σ = 30001011000002. Its totient is φ = 30001011000000.
The previous prime is 30001010999909. The next prime is 30001011000089. The reversal of 30001011000001 is 10000011010003.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26084870802225 + 3916140197776 = 5107335^2 + 1978924^2 .
It is a cyclic number.
It is not a de Polignac number, because 30001011000001 - 29 = 30001010999489 is a prime.
It is a super-2 number, since 2×300010110000012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30001011004001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15000505500000 + 15000505500001.
It is an arithmetic number, because the mean of its divisors is an integer number (15000505500001).
Almost surely, 230001011000001 is an apocalyptic number.
It is an amenable number.
30001011000001 is a deficient number, since it is larger than the sum of its proper divisors (1).
30001011000001 is an equidigital number, since it uses as much as digits as its factorization.
30001011000001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 30001011000001 its reverse (10000011010003), we get a palindrome (40001022010004).
The spelling of 30001011000001 in words is "thirty trillion, one billion, eleven million, one", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •