Base | Representation |
---|---|
bin | 10111111011011100110111… |
… | …010010000001101000010100 |
3 | 111210121220011011112202210201 |
4 | 113323130313102001220110 |
5 | 102243230031322013121 |
6 | 1011454453503230244 |
7 | 31111242654555526 |
oct | 2773346722015024 |
9 | 453556134482721 |
10 | 105240511126036 |
11 | 30595282a09490 |
12 | b9783962a8384 |
13 | 46951a345ac70 |
14 | 1bdb94ca97a16 |
15 | c27831c61e91 |
hex | 5fb737481a14 |
105240511126036 has 192 divisors, whose sum is σ = 222747646464000. Its totient is φ = 42879456622080.
The previous prime is 105240511125889. The next prime is 105240511126057. The reversal of 105240511126036 is 630621115042501.
It is a super-2 number, since 2×1052405111260362 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105240511125986 and 105240511126004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 672002830 + ... + 672159418.
It is an arithmetic number, because the mean of its divisors is an integer number (1160143992000).
Almost surely, 2105240511126036 is an apocalyptic number.
It is an amenable number.
105240511126036 is an abundant number, since it is smaller than the sum of its proper divisors (117507135337964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105240511126036 is a wasteful number, since it uses less digits than its factorization.
105240511126036 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156942 (or 156940 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 37.
Adding to 105240511126036 its reverse (630621115042501), we get a palindrome (735861626168537).
The spelling of 105240511126036 in words is "one hundred five trillion, two hundred forty billion, five hundred eleven million, one hundred twenty-six thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •