Base | Representation |
---|---|
bin | 101111100011001010… |
… | …0100011011011000110 |
3 | 100202120022211220101200 |
4 | 1133012110203123012 |
5 | 3133111022241200 |
6 | 114524232203330 |
7 | 10243263431520 |
oct | 1370624433306 |
9 | 322508756350 |
10 | 102111524550 |
11 | 3a33a325812 |
12 | 17958b39546 |
13 | 9824104059 |
14 | 4d2966aa10 |
15 | 29c97cb800 |
hex | 17c65236c6 |
102111524550 has 72 divisors (see below), whose sum is σ = 313531014576. Its totient is φ = 23339776320.
The previous prime is 102111524527. The next prime is 102111524551. The reversal of 102111524550 is 55425111201.
It is a happy number.
102111524550 is a `hidden beast` number, since 102 + 1 + 1 + 1 + 5 + 2 + 4 + 550 = 666.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102111524551) 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 35 ways as a sum of consecutive naturals, for example, 16205029 + ... + 16211328.
Almost surely, 2102111524550 is an apocalyptic number.
102111524550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102111524550 is an abundant number, since it is smaller than the sum of its proper divisors (211419490026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102111524550 is a wasteful number, since it uses less digits than its factorization.
102111524550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32416382 (or 32416374 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
Adding to 102111524550 its reverse (55425111201), we get a palindrome (157536635751).
The spelling of 102111524550 in words is "one hundred two billion, one hundred eleven million, five hundred twenty-four thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •