Base | Representation |
---|---|
bin | 111110111010011… |
… | …101011111100000 |
3 | 2201120010121000012 |
4 | 332322131133200 |
5 | 4130202400134 |
6 | 252423144052 |
7 | 35104465022 |
oct | 7672353740 |
9 | 2646117005 |
10 | 1055512544 |
11 | 4a189a219 |
12 | 2555a5028 |
13 | 13a8a5748 |
14 | a027c012 |
15 | 629e96ce |
hex | 3ee9d7e0 |
1055512544 has 12 divisors (see below), whose sum is σ = 2078040384. Its totient is φ = 527756256.
The previous prime is 1055512477. The next prime is 1055512589. The reversal of 1055512544 is 4452155501.
It is a super-2 number, since 2×10555125442 = 2228213461082703872, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 32984767 = 1055512544 / (1 + 0 + 5 + 5 + 5 + 1 + 2 + 5 + 4 + 4).
It is a self number, because there is not a number n which added to its sum of digits gives 1055512544.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 16492352 + ... + 16492415.
It is an arithmetic number, because the mean of its divisors is an integer number (173170032).
Almost surely, 21055512544 is an apocalyptic number.
It is an amenable number.
1055512544 is a deficient number, since it is larger than the sum of its proper divisors (1022527840).
1055512544 is an equidigital number, since it uses as much as digits as its factorization.
1055512544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32984777 (or 32984769 counting only the distinct ones).
The product of its (nonzero) digits is 20000, while the sum is 32.
The square root of 1055512544 is about 32488.6525420800. The cubic root of 1055512544 is about 1018.1719609203.
The spelling of 1055512544 in words is "one billion, fifty-five million, five hundred twelve thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •