Base | Representation |
---|---|
bin | 111110111010111… |
… | …111000100110100 |
3 | 2201120101120200212 |
4 | 332322333010310 |
5 | 4130221300400 |
6 | 252430124552 |
7 | 35105610041 |
oct | 7672770464 |
9 | 2646346625 |
10 | 1055650100 |
11 | 4a19835aa |
12 | 255650758 |
13 | 13a92323b |
14 | a02b61c8 |
15 | 62a25335 |
hex | 3eebf134 |
1055650100 has 36 divisors (see below), whose sum is σ = 2306167500. Its totient is φ = 419420160.
The previous prime is 1055650039. The next prime is 1055650109. The reversal of 1055650100 is 10565501.
It can be written as a sum of positive squares in 6 ways, for example, as 34975396 + 1020674704 = 5914^2 + 31948^2 .
It is a super-2 number, since 2×10556501002 = 2228794267260020000, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055650109) by changing a digit.
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 in 11 ways as a sum of consecutive naturals, for example, 20525 + ... + 50324.
Almost surely, 21055650100 is an apocalyptic number.
1055650100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1055650100 is an abundant number, since it is smaller than the sum of its proper divisors (1250517400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055650100 is a wasteful number, since it uses less digits than its factorization.
1055650100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71012 (or 71005 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 23.
The square root of 1055650100 is about 32490.7694584170. The cubic root of 1055650100 is about 1018.2161889053.
The spelling of 1055650100 in words is "one billion, fifty-five million, six hundred fifty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •