Base | Representation |
---|---|
bin | 11110011111001110010… |
… | …01011001110110000101 |
3 | 10201010220220122112001200 |
4 | 33033213021121312011 |
5 | 114130343043224411 |
6 | 2121123512213113 |
7 | 135453251023131 |
oct | 17174711316605 |
9 | 3633826575050 |
10 | 1047555054981 |
11 | 3742a1578626 |
12 | 14b03409a199 |
13 | 77a26644326 |
14 | 389b81783c1 |
15 | 1c3b1657e56 |
hex | f3e7259d85 |
1047555054981 has 24 divisors (see below), whose sum is σ = 1528392530496. Its totient is φ = 691333168320.
The previous prime is 1047555054899. The next prime is 1047555054989. The reversal of 1047555054981 is 1894505557401.
1047555054981 is a `hidden beast` number, since 1 + 0 + 4 + 7 + 5 + 550 + 5 + 4 + 9 + 81 = 666.
It is not a de Polignac number, because 1047555054981 - 27 = 1047555054853 is a prime.
It is a super-2 number, since 2×10475550549812 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1047555054989) 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 in 23 ways as a sum of consecutive naturals, for example, 2306686 + ... + 2723216.
It is an arithmetic number, because the mean of its divisors is an integer number (63683022104).
Almost surely, 21047555054981 is an apocalyptic number.
It is an amenable number.
1047555054981 is a deficient number, since it is larger than the sum of its proper divisors (480837475515).
1047555054981 is a wasteful number, since it uses less digits than its factorization.
1047555054981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419353 (or 419350 counting only the distinct ones).
The product of its (nonzero) digits is 5040000, while the sum is 54.
The spelling of 1047555054981 in words is "one trillion, forty-seven billion, five hundred fifty-five million, fifty-four thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •