Base | Representation |
---|---|
bin | 111011100110111… |
… | …010001011111111 |
3 | 2120200210002022111 |
4 | 323212322023333 |
5 | 4022003234201 |
6 | 243122354451 |
7 | 33532221565 |
oct | 7346721377 |
9 | 2520702274 |
10 | 1000055551 |
11 | 4735615a0 |
12 | 23aabba27 |
13 | 12c259561 |
14 | 96b63a35 |
15 | 5cbe2b51 |
hex | 3b9ba2ff |
1000055551 has 8 divisors (see below), whose sum is σ = 1093852800. Its totient is φ = 906738840.
The previous prime is 1000055527. The next prime is 1000055597. The reversal of 1000055551 is 1555500001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1000055551 - 27 = 1000055423 is a prime.
It is a super-2 number, since 2×10000555512 = 2000222210171827202, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000055521) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 115771 + ... + 124108.
It is an arithmetic number, because the mean of its divisors is an integer number (136731600).
Almost surely, 21000055551 is an apocalyptic number.
1000055551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1000055551 is a deficient number, since it is larger than the sum of its proper divisors (93797249).
1000055551 is a wasteful number, since it uses less digits than its factorization.
1000055551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240269.
The product of its (nonzero) digits is 625, while the sum is 22.
The square root of 1000055551 is about 31623.6549279175. The cubic root of 1000055551 is about 1000.0185166571.
Adding to 1000055551 its reverse (1555500001), we get a palindrome (2555555552).
The spelling of 1000055551 in words is "one billion, fifty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.196 sec. • engine limits •