Base | Representation |
---|---|
bin | 11110101100111111100… |
… | …01000000111001001101 |
3 | 10201212000002200020122221 |
4 | 33112133301000321031 |
5 | 114241013014213311 |
6 | 2124345224135341 |
7 | 136134403030045 |
oct | 17263761007115 |
9 | 3655002606587 |
10 | 1054947413581 |
11 | 377445348aa6 |
12 | 150557907551 |
13 | 78634014709 |
14 | 390b9c6a725 |
15 | 1c695626671 |
hex | f59fc40e4d |
1054947413581 has 2 divisors, whose sum is σ = 1054947413582. Its totient is φ = 1054947413580.
The previous prime is 1054947413567. The next prime is 1054947413633. The reversal of 1054947413581 is 1853147494501.
It is an a-pointer prime, because the next prime (1054947413633) can be obtained adding 1054947413581 to its sum of digits (52).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 552182748100 + 502764665481 = 743090^2 + 709059^2 .
It is a cyclic number.
It is not a de Polignac number, because 1054947413581 - 27 = 1054947413453 is a prime.
It is a super-2 number, since 2×10549474135812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1054947413081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527473706790 + 527473706791.
It is an arithmetic number, because the mean of its divisors is an integer number (527473706791).
Almost surely, 21054947413581 is an apocalyptic number.
It is an amenable number.
1054947413581 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054947413581 is an equidigital number, since it uses as much as digits as its factorization.
1054947413581 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2419200, while the sum is 52.
The spelling of 1054947413581 in words is "one trillion, fifty-four billion, nine hundred forty-seven million, four hundred thirteen thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •