Base | Representation |
---|---|
bin | 111110111010011… |
… | …110011000000000 |
3 | 2201120010202222010 |
4 | 332322132120000 |
5 | 4130203004120 |
6 | 252423212520 |
7 | 35104511406 |
oct | 7672363000 |
9 | 2646122863 |
10 | 1055516160 |
11 | 4a18a1a06 |
12 | 2555a7140 |
13 | 13a8a729a |
14 | a027d476 |
15 | 629ea7e0 |
hex | 3ee9e600 |
1055516160 has 80 divisors (see below), whose sum is σ = 3374377776. Its totient is φ = 281468928.
The previous prime is 1055516153. The next prime is 1055516171. The reversal of 1055516160 is 616155501.
1055516160 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×10555161602 = 2228228728042291200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61039 + ... + 76398.
Almost surely, 21055516160 is an apocalyptic number.
1055516160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1055516160 is an abundant number, since it is smaller than the sum of its proper divisors (2318861616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055516160 is an equidigital number, since it uses as much as digits as its factorization.
1055516160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137463 (or 137447 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 30.
The square root of 1055516160 is about 32488.7081922320. The cubic root of 1055516160 is about 1018.1731236116.
The spelling of 1055516160 in words is "one billion, fifty-five million, five hundred sixteen thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •