Base | Representation |
---|---|
bin | 1001001111011100101101… |
… | …1010000000001101101111 |
3 | 1022222101100021102020111202 |
4 | 2103313023122000031233 |
5 | 2312434222110342021 |
6 | 33335523105240115 |
7 | 2066052210015515 |
oct | 223671332001557 |
9 | 38871307366452 |
10 | 10161010246511 |
11 | 3268295429353 |
12 | 118133193303b |
13 | 5892437ac137 |
14 | 271b1cc9a4b5 |
15 | 1294a0437a0b |
hex | 93dcb68036f |
10161010246511 has 8 divisors (see below), whose sum is σ = 10488844021248. Its totient is φ = 9833180175000.
The previous prime is 10161010246357. The next prime is 10161010246567. The reversal of 10161010246511 is 11564201016101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10161010246511 is a prime.
It is a super-2 number, since 2×101610102465112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10161010246591) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 5319116 + ... + 6972446.
It is an arithmetic number, because the mean of its divisors is an integer number (1311105502656).
Almost surely, 210161010246511 is an apocalyptic number.
10161010246511 is a deficient number, since it is larger than the sum of its proper divisors (327833774737).
10161010246511 is a wasteful number, since it uses less digits than its factorization.
10161010246511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1851613.
The product of its (nonzero) digits is 1440, while the sum is 29.
The spelling of 10161010246511 in words is "ten trillion, one hundred sixty-one billion, ten million, two hundred forty-six thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •