Base | Representation |
---|---|
bin | 110001110011000111… |
… | …0111011001110000000 |
3 | 101020000222000202110222 |
4 | 1203212032323032000 |
5 | 3223004110343420 |
6 | 121043423442212 |
7 | 10504056021110 |
oct | 1434616731600 |
9 | 336028022428 |
10 | 106941887360 |
11 | 413989a88a0 |
12 | 18886756368 |
13 | a113a797b9 |
14 | 5266db1040 |
15 | 2bad8c5225 |
hex | 18e63bb380 |
106941887360 has 512 divisors, whose sum is σ = 331537536000. Its totient is φ = 32018595840.
The previous prime is 106941887357. The next prime is 106941887389. The reversal of 106941887360 is 63788149601.
It is a super-2 number, since 2×1069418873602 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 162278711 + ... + 162279369.
It is an arithmetic number, because the mean of its divisors is an integer number (647534250).
Almost surely, 2106941887360 is an apocalyptic number.
106941887360 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 106941887360, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165768768000).
106941887360 is an abundant number, since it is smaller than the sum of its proper divisors (224595648640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106941887360 is a wasteful number, since it uses less digits than its factorization.
106941887360 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 822 (or 810 counting only the distinct ones).
The product of its (nonzero) digits is 1741824, while the sum is 53.
The spelling of 106941887360 in words is "one hundred six billion, nine hundred forty-one million, eight hundred eighty-seven thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •