Base | Representation |
---|---|
bin | 1100101100111… |
… | …11101001001000 |
3 | 21102111210221100 |
4 | 12112133221020 |
5 | 204234410242 |
6 | 14323541400 |
7 | 2432513523 |
oct | 626375110 |
9 | 242453840 |
10 | 106560072 |
11 | 55172183 |
12 | 2b82a860 |
13 | 190cc6c8 |
14 | 1021bbba |
15 | 954d54c |
hex | 659fa48 |
106560072 has 24 divisors (see below), whose sum is σ = 288600390. Its totient is φ = 35520000.
The previous prime is 106560067. The next prime is 106560073. The reversal of 106560072 is 270065601.
106560072 is a `hidden beast` number, since 1 + 0 + 656 + 0 + 0 + 7 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 106378596 + 181476 = 10314^2 + 426^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×1065600722 = 22710097889290368, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106560073) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 739929 + ... + 740072.
Almost surely, 2106560072 is an apocalyptic number.
106560072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
106560072 is an abundant number, since it is smaller than the sum of its proper divisors (182040318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106560072 is a wasteful number, since it uses less digits than its factorization.
106560072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1480013 (or 1480006 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 106560072 is about 10322.7938078797. The cubic root of 106560072 is about 474.0944105058.
The spelling of 106560072 in words is "one hundred six million, five hundred sixty thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •