Base | Representation |
---|---|
bin | 110001011111001001… |
… | …1111010011111100110 |
3 | 101011022021201100211100 |
4 | 1202332103322133212 |
5 | 3220121124401340 |
6 | 120453140020530 |
7 | 10451344000125 |
oct | 1427623723746 |
9 | 334267640740 |
10 | 106272106470 |
11 | 41084919572 |
12 | 1871a391746 |
13 | a03808b04a |
14 | 5202061abc |
15 | 2b6ebc1830 |
hex | 18be4fa7e6 |
106272106470 has 24 divisors (see below), whose sum is σ = 276307477056. Its totient is φ = 28339228368.
The previous prime is 106272106453. The next prime is 106272106483. The reversal of 106272106470 is 74601272601.
106272106470 is a `hidden beast` number, since 1 + 0 + 6 + 2 + 7 + 2 + 1 + 0 + 647 + 0 = 666.
It is a super-2 number, since 2×1062721064702 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 590400502 + ... + 590400681.
It is an arithmetic number, because the mean of its divisors is an integer number (11512811544).
Almost surely, 2106272106470 is an apocalyptic number.
106272106470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106272106470 is an abundant number, since it is smaller than the sum of its proper divisors (170035370586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106272106470 is a wasteful number, since it uses less digits than its factorization.
106272106470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1180801196 (or 1180801193 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 36.
The spelling of 106272106470 in words is "one hundred six billion, two hundred seventy-two million, one hundred six thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •