Base | Representation |
---|---|
bin | 1101111001001100011101… |
… | …11011010000100110010001 |
3 | 11000011210100021102210200112 |
4 | 12330212032323100212101 |
5 | 13001033010032304401 |
6 | 144551342545331105 |
7 | 6302226303265553 |
oct | 674461673204621 |
9 | 130153307383615 |
10 | 30552500275601 |
11 | 980a2739a3677 |
12 | 3515342636a95 |
13 | 140811c324755 |
14 | 778a6adc34d3 |
15 | 37eb19a343bb |
hex | 1bc98eed0991 |
30552500275601 has 2 divisors, whose sum is σ = 30552500275602. Its totient is φ = 30552500275600.
The previous prime is 30552500275541. The next prime is 30552500275607. The reversal of 30552500275601 is 10657200525503.
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., 15548226879376 + 15004273396225 = 3943124^2 + 3873535^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30552500275601 is a prime.
It is a super-2 number, since 2×305525002756012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30552500275607) 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, 15276250137800 + 15276250137801.
It is an arithmetic number, because the mean of its divisors is an integer number (15276250137801).
Almost surely, 230552500275601 is an apocalyptic number.
It is an amenable number.
30552500275601 is a deficient number, since it is larger than the sum of its proper divisors (1).
30552500275601 is an equidigital number, since it uses as much as digits as its factorization.
30552500275601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 315000, while the sum is 41.
The spelling of 30552500275601 in words is "thirty trillion, five hundred fifty-two billion, five hundred million, two hundred seventy-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •