Base | Representation |
---|---|
bin | 1101101010101001100110… |
… | …10111010001010100110001 |
3 | 10221102000101200012010210012 |
4 | 12311110303113101110301 |
5 | 12414341011431032101 |
6 | 143530013005544305 |
7 | 6221145052251551 |
oct | 665246327212461 |
9 | 127360350163705 |
10 | 30052747908401 |
11 | 96373317a2389 |
12 | 3454510575095 |
13 | 139cc6759aa7a |
14 | 75c7bca21161 |
15 | 371b1aa18bbb |
hex | 1b55335d1531 |
30052747908401 has 2 divisors, whose sum is σ = 30052747908402. Its totient is φ = 30052747908400.
The previous prime is 30052747908397. The next prime is 30052747908419. The reversal of 30052747908401 is 10480974725003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21542371173376 + 8510376735025 = 4641376^2 + 2917255^2 .
It is a cyclic number.
It is not a de Polignac number, because 30052747908401 - 22 = 30052747908397 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30052747908401.
It is not a weakly prime, because it can be changed into another prime (30052747908461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15026373954200 + 15026373954201.
It is an arithmetic number, because the mean of its divisors is an integer number (15026373954201).
Almost surely, 230052747908401 is an apocalyptic number.
It is an amenable number.
30052747908401 is a deficient number, since it is larger than the sum of its proper divisors (1).
30052747908401 is an equidigital number, since it uses as much as digits as its factorization.
30052747908401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1693440, while the sum is 50.
The spelling of 30052747908401 in words is "thirty trillion, fifty-two billion, seven hundred forty-seven million, nine hundred eight thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •