Base | Representation |
---|---|
bin | 110001101001011111… |
… | …1101001011111000100 |
3 | 101012012110200020200011 |
4 | 1203102333221133010 |
5 | 3221323443143320 |
6 | 120551413400004 |
7 | 10463056346134 |
oct | 1432277513704 |
9 | 335173606604 |
10 | 106619115460 |
11 | 41242790560 |
12 | 187b6639004 |
13 | a091c37a00 |
14 | 5236190ac4 |
15 | 2b903b905a |
hex | 18d2fe97c4 |
106619115460 has 144 divisors (see below), whose sum is σ = 264810615552. Its totient is φ = 35744716800.
The previous prime is 106619115457. The next prime is 106619115479. The reversal of 106619115460 is 64511916601.
It is a super-2 number, since 2×1066191154602 (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 47 ways as a sum of consecutive naturals, for example, 49336780 + ... + 49338940.
It is an arithmetic number, because the mean of its divisors is an integer number (1838962608).
Almost surely, 2106619115460 is an apocalyptic number.
106619115460 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 106619115460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132405307776).
106619115460 is an abundant number, since it is smaller than the sum of its proper divisors (158191500092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106619115460 is a wasteful number, since it uses less digits than its factorization.
106619115460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3534 (or 3519 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 40.
The spelling of 106619115460 in words is "one hundred six billion, six hundred nineteen million, one hundred fifteen thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •