Base | Representation |
---|---|
bin | 101111000101000000… |
… | …1111011110000110110 |
3 | 100122221211111200001012 |
4 | 1132022001323300312 |
5 | 3124023100314200 |
6 | 114240020032222 |
7 | 10206231624230 |
oct | 1361201736066 |
9 | 318854450035 |
10 | 101100010550 |
11 | 39970358330 |
12 | 17716232672 |
13 | 96c2695166 |
14 | 4c711a3250 |
15 | 296aac3a35 |
hex | 178a07bc36 |
101100010550 has 96 divisors (see below), whose sum is σ = 236864839680. Its totient is φ = 31186713600.
The previous prime is 101100010549. The next prime is 101100010601. The reversal of 101100010550 is 55010001101.
It is a super-2 number, since 2×1011000105502 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 238091 + ... + 508809.
It is an arithmetic number, because the mean of its divisors is an integer number (2467342080).
Almost surely, 2101100010550 is an apocalyptic number.
101100010550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101100010550 is an abundant number, since it is smaller than the sum of its proper divisors (135764829130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101100010550 is a wasteful number, since it uses less digits than its factorization.
101100010550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270846 (or 270841 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 14.
Adding to 101100010550 its reverse (55010001101), we get a palindrome (156110011651).
The spelling of 101100010550 in words is "one hundred one billion, one hundred million, ten thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •