Base | Representation |
---|---|
bin | 110001100011011101… |
… | …0110000011011110010 |
3 | 101011200100102122120200 |
4 | 1203012322300123302 |
5 | 3220420111202420 |
6 | 120515335020030 |
7 | 10455046244601 |
oct | 1430672603362 |
9 | 334610378520 |
10 | 106416506610 |
11 | 41149386527 |
12 | 1875a80a616 |
13 | a05bc7910b |
14 | 52172cda38 |
15 | 2b7c6e6b90 |
hex | 18c6eb06f2 |
106416506610 has 24 divisors (see below), whose sum is σ = 276682917420. Its totient is φ = 28377735072.
The previous prime is 106416506543. The next prime is 106416506633. The reversal of 106416506610 is 16605614601.
It is a happy number.
106416506610 is a `hidden beast` number, since 1 + 0 + 641 + 6 + 5 + 0 + 6 + 6 + 1 + 0 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 97473210849 + 8943295761 = 312207^2 + 94569^2 .
It is a super-2 number, since 2×1064165066102 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 591202725 + ... + 591202904.
Almost surely, 2106416506610 is an apocalyptic number.
106416506610 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106416506610 is an abundant number, since it is smaller than the sum of its proper divisors (170266410810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106416506610 is a wasteful number, since it uses less digits than its factorization.
106416506610 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1182405642 (or 1182405639 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The spelling of 106416506610 in words is "one hundred six billion, four hundred sixteen million, five hundred six thousand, six hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •