Base | Representation |
---|---|
bin | 111110111010011… |
… | …011001100001001 |
3 | 2201120010010001220 |
4 | 332322123030021 |
5 | 4130202044423 |
6 | 252423032253 |
7 | 35104425360 |
oct | 7672331411 |
9 | 2646103056 |
10 | 1055503113 |
11 | 4a1893125 |
12 | 25559b689 |
13 | 13a8a1372 |
14 | a02787d7 |
15 | 629e69e3 |
hex | 3ee9b309 |
1055503113 has 8 divisors (see below), whose sum is σ = 1608385728. Its totient is φ = 603144624.
The previous prime is 1055503103. The next prime is 1055503153. The reversal of 1055503113 is 3113055501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1055503113 - 26 = 1055503049 is a prime.
It is a super-2 number, since 2×10555031132 = 2228173643105381538, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1055503103) by changing a digit.
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 in 7 ways as a sum of consecutive naturals, for example, 25131006 + ... + 25131047.
It is an arithmetic number, because the mean of its divisors is an integer number (201048216).
Almost surely, 21055503113 is an apocalyptic number.
It is an amenable number.
1055503113 is a deficient number, since it is larger than the sum of its proper divisors (552882615).
1055503113 is an equidigital number, since it uses as much as digits as its factorization.
1055503113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50262063.
The product of its (nonzero) digits is 1125, while the sum is 24.
The square root of 1055503113 is about 32488.5073987710. The cubic root of 1055503113 is about 1018.1689284573.
Adding to 1055503113 its reverse (3113055501), we get a palindrome (4168558614).
The spelling of 1055503113 in words is "one billion, fifty-five million, five hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •