Base | Representation |
---|---|
bin | 110001001001101001… |
… | …1001111100000010100 |
3 | 101002102222220110200212 |
4 | 1202103103033200110 |
5 | 3212131412310400 |
6 | 120253401424552 |
7 | 10424432350460 |
oct | 1422323174024 |
9 | 332388813625 |
10 | 105550510100 |
11 | 40844569532 |
12 | 1855879b158 |
13 | 9c51729a49 |
14 | 51742a54a0 |
15 | 2b2b685335 |
hex | 18934cf814 |
105550510100 has 36 divisors (see below), whose sum is σ = 261765266784. Its totient is φ = 36188746080.
The previous prime is 105550510097. The next prime is 105550510103. The reversal of 105550510100 is 1015055501.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (105550510097) and next prime (105550510103).
It is a super-2 number, since 2×1055505101002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105550510103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 75392522 + ... + 75393921.
Almost surely, 2105550510100 is an apocalyptic number.
105550510100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105550510100 is an abundant number, since it is smaller than the sum of its proper divisors (156214756684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105550510100 is a wasteful number, since it uses less digits than its factorization.
105550510100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150786464 (or 150786457 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 23.
Adding to 105550510100 its reverse (1015055501), we get a palindrome (106565565601).
The spelling of 105550510100 in words is "one hundred five billion, five hundred fifty million, five hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •