Base | Representation |
---|---|
bin | 110001101010100100… |
… | …0100110000010010101 |
3 | 101012021222020010200000 |
4 | 1203111020212002111 |
5 | 3221412140440221 |
6 | 120555135041513 |
7 | 10464003445530 |
oct | 1432510460225 |
9 | 335258203600 |
10 | 106655015061 |
11 | 41260a80451 |
12 | 18806670299 |
13 | a0994c708a |
14 | 523ac57a17 |
15 | 2b9360ae26 |
hex | 18d5226095 |
106655015061 has 48 divisors (see below), whose sum is σ = 182633138688. Its totient is φ = 60930111600.
The previous prime is 106655015003. The next prime is 106655015101. The reversal of 106655015061 is 160510556601.
It is not a de Polignac number, because 106655015061 - 211 = 106655013013 is a prime.
It is a super-2 number, since 2×1066550150612 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106655015161) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11376706 + ... + 11386076.
It is an arithmetic number, because the mean of its divisors is an integer number (3804857056).
Almost surely, 2106655015061 is an apocalyptic number.
It is an amenable number.
106655015061 is a deficient number, since it is larger than the sum of its proper divisors (75978123627).
106655015061 is an frugal number, since it uses more digits than its factorization.
106655015061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16084 (or 16072 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 36.
The spelling of 106655015061 in words is "one hundred six billion, six hundred fifty-five million, fifteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •