Base | Representation |
---|---|
bin | 110001100101100010… |
… | …1110100000000000000 |
3 | 101011212020011101012112 |
4 | 1203023011310000000 |
5 | 3221041021414124 |
6 | 120530315314452 |
7 | 10456556301026 |
oct | 1431305640000 |
9 | 334766141175 |
10 | 106486513664 |
11 | 411849518a3 |
12 | 1877a14ba28 |
13 | a07061abcb |
14 | 5222714716 |
15 | 2b8392490e |
hex | 18cb174000 |
106486513664 has 90 divisors (see below), whose sum is σ = 215290003110. Its totient is φ = 52668399616.
The previous prime is 106486513657. The next prime is 106486513703. The reversal of 106486513664 is 466315684601.
It can be written as a sum of positive squares in 3 ways, for example, as 866713600 + 105619800064 = 29440^2 + 324992^2 .
It is a super-3 number, since 3×1064865136643 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 209207042 + ... + 209207550.
Almost surely, 2106486513664 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106486513664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107645001555).
106486513664 is an abundant number, since it is smaller than the sum of its proper divisors (108803489446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106486513664 is an frugal number, since it uses more digits than its factorization.
106486513664 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 763 (or 624 counting only the distinct ones).
The product of its (nonzero) digits is 2488320, while the sum is 50.
The spelling of 106486513664 in words is "one hundred six billion, four hundred eighty-six million, five hundred thirteen thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •