Base | Representation |
---|---|
bin | 1100101011110… |
… | …00110101011001 |
3 | 21102012201212222 |
4 | 12111320311121 |
5 | 204214313423 |
6 | 14320313425 |
7 | 2431252220 |
oct | 625706531 |
9 | 242181788 |
10 | 106401113 |
11 | 55073805 |
12 | 2b772875 |
13 | 19075250 |
14 | 101b9cb7 |
15 | 951b3c8 |
hex | 6578d59 |
106401113 has 32 divisors (see below), whose sum is σ = 140152320. Its totient is φ = 78382080.
The previous prime is 106401107. The next prime is 106401149. The reversal of 106401113 is 311104601.
It is not a de Polignac number, because 106401113 - 28 = 106400857 is a prime.
It is a super-2 number, since 2×1064011132 = 22642393695277538, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 106401091 and 106401100.
It is not an unprimeable number, because it can be changed into a prime (106401193) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 168308 + ... + 168938.
It is an arithmetic number, because the mean of its divisors is an integer number (4379760).
Almost surely, 2106401113 is an apocalyptic number.
106401113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
106401113 is a deficient number, since it is larger than the sum of its proper divisors (33751207).
106401113 is a wasteful number, since it uses less digits than its factorization.
106401113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 106401113 is about 10315.0915168020. The cubic root of 106401113 is about 473.8585526898.
Adding to 106401113 its reverse (311104601), we get a palindrome (417505714).
The spelling of 106401113 in words is "one hundred six million, four hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •