Base | Representation |
---|---|
bin | 110001000101100001… |
… | …1010001100110100100 |
3 | 101002002100110211212112 |
4 | 1202023003101212210 |
5 | 3211340444403120 |
6 | 120231535140152 |
7 | 10421132060060 |
oct | 1421303214644 |
9 | 332070424775 |
10 | 105412106660 |
11 | 40783427a23 |
12 | 1851a374658 |
13 | 9c2bb5b313 |
14 | 515db58aa0 |
15 | 2b1e446bc5 |
hex | 188b0d19a4 |
105412106660 has 96 divisors (see below), whose sum is σ = 258602803200. Its totient is φ = 35340709248.
The previous prime is 105412106659. The next prime is 105412106687. The reversal of 105412106660 is 66601214501.
It is a super-2 number, since 2×1054121066602 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8040791 + ... + 8053889.
It is an arithmetic number, because the mean of its divisors is an integer number (2693779200).
Almost surely, 2105412106660 is an apocalyptic number.
105412106660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105412106660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129301401600).
105412106660 is an abundant number, since it is smaller than the sum of its proper divisors (153190696540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105412106660 is a wasteful number, since it uses less digits than its factorization.
105412106660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14385 (or 14383 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 32.
The spelling of 105412106660 in words is "one hundred five billion, four hundred twelve million, one hundred six thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •