Base | Representation |
---|---|
bin | 110001101001011010… |
… | …0011000011101101000 |
3 | 101012012021010012111101 |
4 | 1203102310120131220 |
5 | 3221322214142102 |
6 | 120551230211144 |
7 | 10463022265663 |
oct | 1432264303550 |
9 | 335167105441 |
10 | 106616162152 |
11 | 41241053705 |
12 | 187b5653ab4 |
13 | a0914426a6 |
14 | 5235a226da |
15 | 2b8eed3e87 |
hex | 18d2d18768 |
106616162152 has 32 divisors (see below), whose sum is σ = 207191773800. Its totient is φ = 51391459584.
The previous prime is 106616162143. The next prime is 106616162197. The reversal of 106616162152 is 251261616601.
It can be written as a sum of positive squares in 4 ways, for example, as 106410354436 + 205807716 = 326206^2 + 14346^2 .
It is a super-2 number, since 2×1066161621522 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1619983 + ... + 1684510.
Almost surely, 2106616162152 is an apocalyptic number.
It is an amenable number.
106616162152 is a deficient number, since it is larger than the sum of its proper divisors (100575611648).
106616162152 is a wasteful number, since it uses less digits than its factorization.
106616162152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3304645 (or 3304641 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 37.
Adding to 106616162152 its reverse (251261616601), we get a palindrome (357877778753).
The spelling of 106616162152 in words is "one hundred six billion, six hundred sixteen million, one hundred sixty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •