Base | Representation |
---|---|
bin | 110001101101100110… |
… | …1101111101100010000 |
3 | 101012120002011221222010 |
4 | 1203123031233230100 |
5 | 3222114244403444 |
6 | 121013221342520 |
7 | 10466352525261 |
oct | 1433315575420 |
9 | 335502157863 |
10 | 106757028624 |
11 | 41303617784 |
12 | 18834867a40 |
13 | a0b469422c |
14 | 524a610968 |
15 | 2b9c55c2b9 |
hex | 18db36fb10 |
106757028624 has 80 divisors (see below), whose sum is σ = 276841031040. Its totient is φ = 35450173440.
The previous prime is 106757028607. The next prime is 106757028641. The reversal of 106757028624 is 426820757601.
106757028624 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (106757028607) and next prime (106757028641).
It is a super-2 number, since 2×1067570286242 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16785157 + ... + 16791515.
It is an arithmetic number, because the mean of its divisors is an integer number (3460512888).
Almost surely, 2106757028624 is an apocalyptic number.
It is an amenable number.
106757028624 is an abundant number, since it is smaller than the sum of its proper divisors (170084002416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106757028624 is a wasteful number, since it uses less digits than its factorization.
106757028624 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7648 (or 7642 counting only the distinct ones).
The product of its (nonzero) digits is 1128960, while the sum is 48.
The spelling of 106757028624 in words is "one hundred six billion, seven hundred fifty-seven million, twenty-eight thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •