Base | Representation |
---|---|
bin | 101111010101111010… |
… | …1000010111000101110 |
3 | 100201102100111121210220 |
4 | 1132223311002320232 |
5 | 3131203231312243 |
6 | 114412153512210 |
7 | 10226255504400 |
oct | 1365365027056 |
9 | 321370447726 |
10 | 101667057198 |
11 | 3a131448923 |
12 | 17854112666 |
13 | 9782cc3715 |
14 | 4cc660cb70 |
15 | 29a0782783 |
hex | 17abd42e2e |
101667057198 has 48 divisors (see below), whose sum is σ = 236850376320. Its totient is φ = 29008573104.
The previous prime is 101667057109. The next prime is 101667057203. The reversal of 101667057198 is 891750766101.
It is a super-2 number, since 2×1016670571982 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101667057198.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14268 + ... + 451151.
It is an arithmetic number, because the mean of its divisors is an integer number (4934382840).
Almost surely, 2101667057198 is an apocalyptic number.
101667057198 is an abundant number, since it is smaller than the sum of its proper divisors (135183319122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101667057198 is a wasteful number, since it uses less digits than its factorization.
101667057198 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466181 (or 466174 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 51.
The spelling of 101667057198 in words is "one hundred one billion, six hundred sixty-seven million, fifty-seven thousand, one hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •