Base | Representation |
---|---|
bin | 1001001111011111000110… |
… | …1000100111100110011000 |
3 | 1022222102222222020222122012 |
4 | 2103313301220213212120 |
5 | 2312442030303041211 |
6 | 33340110500045052 |
7 | 2066104125361100 |
oct | 223676150474630 |
9 | 38872888228565 |
10 | 10161651612056 |
11 | 326859446a81a |
12 | 1181490693788 |
13 | 58931662bc89 |
14 | 271b80130200 |
15 | 1294db8c6d8b |
hex | 93df1a27998 |
10161651612056 has 96 divisors (see below), whose sum is σ = 22656997944000. Its totient is φ = 4258262776320.
The previous prime is 10161651612017. The next prime is 10161651612097. The reversal of 10161651612056 is 65021615616101.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19063886 + ... + 19589666.
It is an arithmetic number, because the mean of its divisors is an integer number (236010395250).
Almost surely, 210161651612056 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 10161651612056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11328498972000).
10161651612056 is an abundant number, since it is smaller than the sum of its proper divisors (12495346331944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10161651612056 is a wasteful number, since it uses less digits than its factorization.
10161651612056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 526897 (or 526886 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 41.
The spelling of 10161651612056 in words is "ten trillion, one hundred sixty-one billion, six hundred fifty-one million, six hundred twelve thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •