Base | Representation |
---|---|
bin | 10111110111111101110011… |
… | …100110111001000000101000 |
3 | 111202202222221120122000000101 |
4 | 113313331303212321000220 |
5 | 102230314024243411021 |
6 | 1011152443521115144 |
7 | 31055033534602033 |
oct | 2767756346710050 |
9 | 452688846560011 |
10 | 105001005060136 |
11 | 30502748a93249 |
12 | b939a94188ab4 |
13 | 46787244c9643 |
14 | 1bd010bc6201a |
15 | c214b5371a91 |
hex | 5f7f739b9028 |
105001005060136 has 16 divisors (see below), whose sum is σ = 197964602084340. Its totient is φ = 52210444504320.
The previous prime is 105001005060037. The next prime is 105001005060137. The reversal of 105001005060136 is 631060500100501.
It can be written as a sum of positive squares in 2 ways, for example, as 103923548604100 + 1077456456036 = 10194290^2 + 1038006^2 .
It is a super-2 number, since 2×1050010050601362 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105001005060137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36257251681 + ... + 36257254576.
Almost surely, 2105001005060136 is an apocalyptic number.
It is an amenable number.
105001005060136 is a deficient number, since it is larger than the sum of its proper divisors (92963597024204).
105001005060136 is a wasteful number, since it uses less digits than its factorization.
105001005060136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72514506444 (or 72514506440 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 28.
Adding to 105001005060136 its reverse (631060500100501), we get a palindrome (736061505160637).
The spelling of 105001005060136 in words is "one hundred five trillion, one billion, five million, sixty thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •