Base | Representation |
---|---|
bin | 11000001111001000001001… |
… | …111101000010010001011000 |
3 | 111222102011022010021011111021 |
4 | 120033020021331002101120 |
5 | 102432403234312102120 |
6 | 1014411554445012224 |
7 | 31311031421035066 |
oct | 3017101175022130 |
9 | 458364263234437 |
10 | 106592665347160 |
11 | 30a667717a5963 |
12 | bb56457b54074 |
13 | 47628506b8775 |
14 | 1c47180ad5036 |
15 | c4cabe704aaa |
hex | 60f209f42458 |
106592665347160 has 32 divisors (see below), whose sum is σ = 245411020221840. Its totient is φ = 41645506460544.
The previous prime is 106592665347143. The next prime is 106592665347247. The reversal of 106592665347160 is 61743566295601.
It is a super-3 number, since 3×1065926653471603 (a number of 43 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 pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30986238207 + ... + 30986241646.
Almost surely, 2106592665347160 is an apocalyptic number.
106592665347160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
106592665347160 is an abundant number, since it is smaller than the sum of its proper divisors (138818354874680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106592665347160 is a wasteful number, since it uses less digits than its factorization.
106592665347160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61972479907 (or 61972479903 counting only the distinct ones).
The product of its (nonzero) digits is 48988800, while the sum is 61.
The spelling of 106592665347160 in words is "one hundred six trillion, five hundred ninety-two billion, six hundred sixty-five million, three hundred forty-seven thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •