Base | Representation |
---|---|
bin | 1100100001001… |
… | …11101010100000 |
3 | 21022121120110000 |
4 | 12100213222200 |
5 | 203341120224 |
6 | 14230540000 |
7 | 2413440642 |
oct | 620475240 |
9 | 238546400 |
10 | 105020064 |
11 | 54310146 |
12 | 2b207600 |
13 | 189b0766 |
14 | dd3a892 |
15 | 93470c9 |
hex | 6427aa0 |
105020064 has 120 divisors (see below), whose sum is σ = 319068288. Its totient is φ = 33851520.
The previous prime is 105020051. The next prime is 105020081. The reversal of 105020064 is 460020501.
It is a happy number.
It is a super-2 number, since 2×1050200642 = 22058427685128192, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 79699 + ... + 81005.
Almost surely, 2105020064 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 105020064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159534144).
105020064 is an abundant number, since it is smaller than the sum of its proper divisors (214048224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105020064 is a wasteful number, since it uses less digits than its factorization.
105020064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1360 (or 1343 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 105020064 is about 10247.9297421479. The cubic root of 105020064 is about 471.7994455820.
Adding to 105020064 its reverse (460020501), we get a palindrome (565040565).
The spelling of 105020064 in words is "one hundred five million, twenty thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •