Base | Representation |
---|---|
bin | 1100101011110… |
… | …11110011010000 |
3 | 21102020100120000 |
4 | 12111323303100 |
5 | 204220211024 |
6 | 14320450000 |
7 | 2431332516 |
oct | 625736320 |
9 | 242210500 |
10 | 106413264 |
11 | 55081951 |
12 | 2b779900 |
13 | 1907a939 |
14 | 101c04b6 |
15 | 951ecc9 |
hex | 657bcd0 |
106413264 has 100 divisors (see below), whose sum is σ = 314723904. Its totient is φ = 34696512.
The previous prime is 106413253. The next prime is 106413271. The reversal of 106413264 is 462314601.
106413264 is a `hidden beast` number, since 10 + 641 + 3 + 2 + 6 + 4 = 666.
It is a super-2 number, since 2×1064132642 = 22647565510267392, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 60039 + ... + 61785.
Almost surely, 2106413264 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106413264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157361952).
106413264 is an abundant number, since it is smaller than the sum of its proper divisors (208310640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106413264 is a wasteful number, since it uses less digits than its factorization.
106413264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1814 (or 1799 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 106413264 is about 10315.6804913685. The cubic root of 106413264 is about 473.8765902082.
Adding to 106413264 its reverse (462314601), we get a palindrome (568727865).
The spelling of 106413264 in words is "one hundred six million, four hundred thirteen thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •