Base | Representation |
---|---|
bin | 111110111110011… |
… | …100000000101011 |
3 | 2201122002120001120 |
4 | 332332130000223 |
5 | 4130434230201 |
6 | 252501350323 |
7 | 35116366266 |
oct | 7676340053 |
9 | 2648076046 |
10 | 1056555051 |
11 | 4a24414a2 |
12 | 255a083a3 |
13 | 13ab7c106 |
14 | a046dcdd |
15 | 62b53536 |
hex | 3ef9c02b |
1056555051 has 8 divisors (see below), whose sum is σ = 1454183424. Its totient is φ = 681648360.
The previous prime is 1056555029. The next prime is 1056555077. The reversal of 1056555051 is 1505556501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1056555051 - 27 = 1056554923 is a prime.
It is a super-2 number, since 2×10565550512 = 2232617151587225202, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (1056555011) 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, 5680311 + ... + 5680496.
It is an arithmetic number, because the mean of its divisors is an integer number (181772928).
Almost surely, 21056555051 is an apocalyptic number.
1056555051 is a deficient number, since it is larger than the sum of its proper divisors (397628373).
1056555051 is a wasteful number, since it uses less digits than its factorization.
1056555051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11360841.
The product of its (nonzero) digits is 18750, while the sum is 33.
The square root of 1056555051 is about 32504.6927535087. The cubic root of 1056555051 is about 1018.5070594582.
The spelling of 1056555051 in words is "one billion, fifty-six million, five hundred fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •