Base | Representation |
---|---|
bin | 1101111001001011101110… |
… | …11100111111000101100111 |
3 | 11000011202022211102002011112 |
4 | 12330211313130333011213 |
5 | 13001031203223313331 |
6 | 144551235520455235 |
7 | 6302213452035566 |
oct | 674456734770547 |
9 | 130152284362145 |
10 | 30552106463591 |
11 | 980a0916748a9 |
12 | 351525277a51b |
13 | 140808886b8ab |
14 | 778a3098dbdd |
15 | 37eae519432b |
hex | 1bc97773f167 |
30552106463591 has 2 divisors, whose sum is σ = 30552106463592. Its totient is φ = 30552106463590.
The previous prime is 30552106463563. The next prime is 30552106463609. The reversal of 30552106463591 is 19536460125503.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30552106463591 - 230 = 30551032721767 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30552106463521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15276053231795 + 15276053231796.
It is an arithmetic number, because the mean of its divisors is an integer number (15276053231796).
Almost surely, 230552106463591 is an apocalyptic number.
30552106463591 is a deficient number, since it is larger than the sum of its proper divisors (1).
30552106463591 is an equidigital number, since it uses as much as digits as its factorization.
30552106463591 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916000, while the sum is 50.
The spelling of 30552106463591 in words is "thirty trillion, five hundred fifty-two billion, one hundred six million, four hundred sixty-three thousand, five hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •