Base | Representation |
---|---|
bin | 110000111100001110… |
… | …1000101010101011010 |
3 | 101001021121101112010100 |
4 | 1201320131011111122 |
5 | 3210221111330200 |
6 | 120140552000230 |
7 | 10410323103303 |
oct | 1417035052532 |
9 | 331247345110 |
10 | 105100105050 |
11 | 406332a6556 |
12 | 18451990076 |
13 | 9bac31a895 |
14 | 513053d7aa |
15 | 2b01d66d00 |
hex | 187874555a |
105100105050 has 72 divisors (see below), whose sum is σ = 287696730204. Its totient is φ = 27497882880.
The previous prime is 105100105049. The next prime is 105100105079. The reversal of 105100105050 is 50501001501.
105100105050 is a `hidden beast` number, since 1 + 0 + 510 + 0 + 105 + 0 + 50 = 666.
It can be written as a sum of positive squares in 6 ways, for example, as 17117273889 + 87982831161 = 130833^2 + 296619^2 .
It is a super-2 number, since 2×1051001050502 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2179507 + ... + 2227206.
Almost surely, 2105100105050 is an apocalyptic number.
105100105050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105100105050 is an abundant number, since it is smaller than the sum of its proper divisors (182596625154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105100105050 is a wasteful number, since it uses less digits than its factorization.
105100105050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4406784 (or 4406776 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 18.
Adding to 105100105050 its reverse (50501001501), we get a palindrome (155601106551).
The spelling of 105100105050 in words is "one hundred five billion, one hundred million, one hundred five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •