Base | Representation |
---|---|
bin | 110001011101110010… |
… | …0101011010000000000 |
3 | 101011012002021111020100 |
4 | 1202323210223100000 |
5 | 3220022344400312 |
6 | 120444415242400 |
7 | 10450245352140 |
oct | 1427344532000 |
9 | 334162244210 |
10 | 106226168832 |
11 | 410609a2983 |
12 | 18706b19400 |
13 | a02b6c5a04 |
14 | 51d9d04920 |
15 | 2b6ab4a5dc |
hex | 18bb92b400 |
106226168832 has 528 divisors, whose sum is σ = 363456018432. Its totient is φ = 29249372160.
The previous prime is 106226168819. The next prime is 106226168843. The reversal of 106226168832 is 238861622601.
106226168832 is a `hidden beast` number, since 1 + 0 + 6 + 22 + 616 + 8 + 8 + 3 + 2 = 666.
It is a super-2 number, since 2×1062261688322 (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 47 ways as a sum of consecutive naturals, for example, 455906188 + ... + 455906420.
Almost surely, 2106226168832 is an apocalyptic number.
106226168832 is a gapful number since it is divisible by the number (12) 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 106226168832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181728009216).
106226168832 is an abundant number, since it is smaller than the sum of its proper divisors (257229849600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106226168832 is a wasteful number, since it uses less digits than its factorization.
106226168832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494 (or 473 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 45.
The spelling of 106226168832 in words is "one hundred six billion, two hundred twenty-six million, one hundred sixty-eight thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •