Base | Representation |
---|---|
bin | 11110101101000000111… |
… | …00001110000011010000 |
3 | 10201212000212222200010111 |
4 | 33112200130032003100 |
5 | 114241023414132124 |
6 | 2124350311011104 |
7 | 136134601221514 |
oct | 17264034160320 |
9 | 3655025880114 |
10 | 1054958739664 |
11 | 3774507844a5 |
12 | 15055b669a94 |
13 | 7863647ba3b |
14 | 390bb578144 |
15 | 1c696612494 |
hex | f5a070e0d0 |
1054958739664 has 10 divisors (see below), whose sum is σ = 2043982558130. Its totient is φ = 527479369824.
The previous prime is 1054958739619. The next prime is 1054958739671. The reversal of 1054958739664 is 4669378594501.
It can be written as a sum of positive squares in only one way, i.e., 554119449664 + 500839290000 = 744392^2 + 707700^2 .
It is a super-2 number, since 2×10549587396642 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1054958739664.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32967460599 + ... + 32967460630.
It is an arithmetic number, because the mean of its divisors is an integer number (204398255813).
Almost surely, 21054958739664 is an apocalyptic number.
It is an amenable number.
1054958739664 is a deficient number, since it is larger than the sum of its proper divisors (989023818466).
1054958739664 is an equidigital number, since it uses as much as digits as its factorization.
1054958739664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65934921237 (or 65934921231 counting only the distinct ones).
The product of its (nonzero) digits is 195955200, while the sum is 67.
The spelling of 1054958739664 in words is "one trillion, fifty-four billion, nine hundred fifty-eight million, seven hundred thirty-nine thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •