Base | Representation |
---|---|
bin | 110001100100011110… |
… | …0110100101011010001 |
3 | 101011202201120220122000 |
4 | 1203020330310223101 |
5 | 3221002323241310 |
6 | 120522553504213 |
7 | 10455642123246 |
oct | 1431074645321 |
9 | 334681526560 |
10 | 106450602705 |
11 | 41166654417 |
12 | 1876a112069 |
13 | a066056615 |
14 | 521ba475cd |
15 | 2b806ce4c0 |
hex | 18c8f34ad1 |
106450602705 has 16 divisors (see below), whose sum is σ = 189245516160. Its totient is φ = 56773654704.
The previous prime is 106450602649. The next prime is 106450602733. The reversal of 106450602705 is 507206054601.
It is a happy number.
106450602705 is a `hidden beast` number, since 1 + 0 + 6 + 45 + 0 + 602 + 7 + 0 + 5 = 666.
It is not a de Polignac number, because 106450602705 - 213 = 106450594513 is a prime.
It is a super-2 number, since 2×1064506027052 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106450602705.
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, 394261357 + ... + 394261626.
It is an arithmetic number, because the mean of its divisors is an integer number (11827844760).
Almost surely, 2106450602705 is an apocalyptic number.
106450602705 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106450602705 is a deficient number, since it is larger than the sum of its proper divisors (82794913455).
106450602705 is an equidigital number, since it uses as much as digits as its factorization.
106450602705 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 788522997 (or 788522991 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The spelling of 106450602705 in words is "one hundred six billion, four hundred fifty million, six hundred two thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •