Base | Representation |
---|---|
bin | 110001010111010110… |
… | …0101010111110101001 |
3 | 101010122000211011021200 |
4 | 1202232230222332221 |
5 | 3214102100123230 |
6 | 120411141354413 |
7 | 10442013333654 |
oct | 1425654527651 |
9 | 333560734250 |
10 | 106010161065 |
11 | 40a5aa77066 |
12 | 18666708a09 |
13 | 9cc5a25473 |
14 | 51b935689b |
15 | 2b56bcd160 |
hex | 18aeb2afa9 |
106010161065 has 96 divisors (see below), whose sum is σ = 192444595200. Its totient is φ = 53922516480.
The previous prime is 106010161057. The next prime is 106010161079. The reversal of 106010161065 is 560161010601.
It is not a de Polignac number, because 106010161065 - 23 = 106010161057 is a prime.
It is a super-2 number, since 2×1060101610652 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 29953066 + ... + 29956604.
It is an arithmetic number, because the mean of its divisors is an integer number (2004631200).
Almost surely, 2106010161065 is an apocalyptic number.
106010161065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106010161065 is a deficient number, since it is larger than the sum of its proper divisors (86434434135).
106010161065 is a wasteful number, since it uses less digits than its factorization.
106010161065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3887 (or 3884 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
Adding to 106010161065 its reverse (560161010601), we get a palindrome (666171171666).
The spelling of 106010161065 in words is "one hundred six billion, ten million, one hundred sixty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •