Base | Representation |
---|---|
bin | 10111000111010110011010… |
… | …000011011001011111101111 |
3 | 111022221121122201121122121211 |
4 | 113013112122003121133233 |
5 | 101311100004332324101 |
6 | 1000114011343135251 |
7 | 30261463446145642 |
oct | 2707263203313757 |
9 | 438847581548554 |
10 | 101660165511151 |
11 | 2a43491a1796a5 |
12 | b49a5078a4527 |
13 | 4495687b99250 |
14 | 1b16541d57a59 |
15 | bb4632debc51 |
hex | 5c759a0d97ef |
101660165511151 has 24 divisors (see below), whose sum is σ = 114451908865056. Its totient is φ = 89756408195520.
The previous prime is 101660165511131. The next prime is 101660165511161. The reversal of 101660165511151 is 151115561066101.
It is a happy number.
It is not a de Polignac number, because 101660165511151 - 233 = 101651575576559 is a prime.
It is a super-3 number, since 3×1016601655111513 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101660165511131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 171842901 + ... + 172433473.
It is an arithmetic number, because the mean of its divisors is an integer number (4768829536044).
Almost surely, 2101660165511151 is an apocalyptic number.
101660165511151 is a deficient number, since it is larger than the sum of its proper divisors (12791743353905).
101660165511151 is a wasteful number, since it uses less digits than its factorization.
101660165511151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 615663 (or 615640 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 40.
The spelling of 101660165511151 in words is "one hundred one trillion, six hundred sixty billion, one hundred sixty-five million, five hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •