Base | Representation |
---|---|
bin | 111110110100111… |
… | …001110001010111 |
3 | 2201110101120100000 |
4 | 332310321301113 |
5 | 4124314234021 |
6 | 252332022343 |
7 | 35056216065 |
oct | 7664716127 |
9 | 2643346300 |
10 | 1054055511 |
11 | 4a0a94563 |
12 | 2550019b3 |
13 | 13a4b54b2 |
14 | 9ddbd035 |
15 | 6280cb26 |
hex | 3ed39c57 |
1054055511 has 48 divisors (see below), whose sum is σ = 1652571648. Its totient is φ = 670680000.
The previous prime is 1054055507. The next prime is 1054055549. The reversal of 1054055511 is 1155504501.
1054055511 is a `hidden beast` number, since 105 + 4 + 0 + 5 + 551 + 1 = 666.
It is not a de Polignac number, because 1054055511 - 22 = 1054055507 is a prime.
It is a super-2 number, since 2×10540555112 = 2222066040538942242, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054055551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 467136 + ... + 469386.
It is an arithmetic number, because the mean of its divisors is an integer number (34428576).
Almost surely, 21054055511 is an apocalyptic number.
1054055511 is a deficient number, since it is larger than the sum of its proper divisors (598516137).
1054055511 is an equidigital number, since it uses as much as digits as its factorization.
1054055511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2354 (or 2342 counting only the distinct ones).
The product of its (nonzero) digits is 2500, while the sum is 27.
The square root of 1054055511 is about 32466.2210766821. The cubic root of 1054055511 is about 1017.7032492051.
The spelling of 1054055511 in words is "one billion, fifty-four million, fifty-five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •