Base | Representation |
---|---|
bin | 100000110010011… |
… | …1101111110000111 |
3 | 2211200020110110120 |
4 | 1001210331332013 |
5 | 4223123210210 |
6 | 301101153023 |
7 | 36156426330 |
oct | 10144757607 |
9 | 2750213416 |
10 | 1100210055 |
11 | 51504910a |
12 | 26855b773 |
13 | 146c25489 |
14 | a6195287 |
15 | 668c8270 |
hex | 4193df87 |
1100210055 has 32 divisors (see below), whose sum is σ = 2014156800. Its totient is φ = 502367232.
The previous prime is 1100210039. The next prime is 1100210071. The reversal of 1100210055 is 5500120011.
It is an interprime number because it is at equal distance from previous prime (1100210039) and next prime (1100210071).
It is not a de Polignac number, because 1100210055 - 24 = 1100210039 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 91906 + ... + 103184.
It is an arithmetic number, because the mean of its divisors is an integer number (62942400).
Almost surely, 21100210055 is an apocalyptic number.
1100210055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1100210055 is a deficient number, since it is larger than the sum of its proper divisors (913946745).
1100210055 is a wasteful number, since it uses less digits than its factorization.
1100210055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12223.
The product of its (nonzero) digits is 50, while the sum is 15.
The square root of 1100210055 is about 33169.4144506652. The cubic root of 1100210055 is about 1032.3458190318.
Adding to 1100210055 its reverse (5500120011), we get a palindrome (6600330066).
The spelling of 1100210055 in words is "one billion, one hundred million, two hundred ten thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •