| Base | Representation |
|---|---|
| bin | 110000110110111010… |
| … | …1100010101000101110 |
| 3 | 101000211012012011212100 |
| 4 | 1201231311202220232 |
| 5 | 3204340010422100 |
| 6 | 120111145515530 |
| 7 | 10403031001650 |
| oct | 1415565425056 |
| 9 | 330735164770 |
| 10 | 104921967150 |
| 11 | 40551795950 |
| 12 | 184021a2ba6 |
| 13 | 9b81449440 |
| 14 | 5114a0c6d0 |
| 15 | 2ae13ca400 |
| hex | 186dd62a2e |
104921967150 has 576 divisors, whose sum is σ = 381070609920. Its totient is φ = 19987430400.
The previous prime is 104921967119. The next prime is 104921967151. The reversal of 104921967150 is 51769129401.
104921967150 is a `hidden beast` number, since 1 + 0 + 492 + 1 + 9 + 6 + 7 + 150 = 666.
It is a super-2 number, since 2×1049219671502 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 104921967096 and 104921967105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104921967151) 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 287 ways as a sum of consecutive naturals, for example, 73422636 + ... + 73424064.
It is an arithmetic number, because the mean of its divisors is an integer number (661580920).
Almost surely, 2104921967150 is an apocalyptic number.
104921967150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 104921967150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (190535304960).
104921967150 is an abundant number, since it is smaller than the sum of its proper divisors (276148642770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104921967150 is a wasteful number, since it uses less digits than its factorization.
104921967150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1641 (or 1633 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 45.
The spelling of 104921967150 in words is "one hundred four billion, nine hundred twenty-one million, nine hundred sixty-seven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •