Base | Representation |
---|---|
bin | 10101100101010001011010… |
… | …01101000011001110001111 |
3 | 20020001010221020200101021201 |
4 | 22302220231031003032033 |
5 | 22210041340114012331 |
6 | 244534520205210331 |
7 | 12665611454315401 |
oct | 1262505515031617 |
9 | 206033836611251 |
10 | 47460147016591 |
11 | 1413880a786591 |
12 | 53a61172609a7 |
13 | 206361b58456a |
14 | ba1124ab6b71 |
15 | 574832407a61 |
hex | 2b2a2d34338f |
47460147016591 has 2 divisors, whose sum is σ = 47460147016592. Its totient is φ = 47460147016590.
The previous prime is 47460147016537. The next prime is 47460147016613. The reversal of 47460147016591 is 19561074106474.
47460147016591 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 47460147016591 - 219 = 47460146492303 is a prime.
It is a super-2 number, since 2×474601470165912 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (47460147316591) 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, 23730073508295 + 23730073508296.
It is an arithmetic number, because the mean of its divisors is an integer number (23730073508296).
Almost surely, 247460147016591 is an apocalyptic number.
47460147016591 is a deficient number, since it is larger than the sum of its proper divisors (1).
47460147016591 is an equidigital number, since it uses as much as digits as its factorization.
47460147016591 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5080320, while the sum is 55.
The spelling of 47460147016591 in words is "forty-seven trillion, four hundred sixty billion, one hundred forty-seven million, sixteen thousand, five hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •