Base | Representation |
---|---|
bin | 10010111011001011… |
… | …11011111110011001 |
3 | 222020002010122020212 |
4 | 21131211323332121 |
5 | 131302000120130 |
6 | 4400103300505 |
7 | 506530640444 |
oct | 113545737631 |
9 | 28202118225 |
10 | 10160160665 |
11 | 43441670a6 |
12 | 1b7674a735 |
13 | c5bc360b5 |
14 | 6c553465b |
15 | 3e6e97e95 |
hex | 25d97bf99 |
10160160665 has 4 divisors (see below), whose sum is σ = 12192192804. Its totient is φ = 8128128528.
The previous prime is 10160160641. The next prime is 10160160679. The reversal of 10160160665 is 56606106101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 56606106101 = 2237 ⋅25304473.
It can be written as a sum of positive squares in 2 ways, for example, as 7874077696 + 2286082969 = 88736^2 + 47813^2 .
It is a cyclic number.
It is not a de Polignac number, because 10160160665 - 216 = 10160095129 is a prime.
It is a super-2 number, since 2×101601606652 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1016016062 + ... + 1016016071.
It is an arithmetic number, because the mean of its divisors is an integer number (3048048201).
Almost surely, 210160160665 is an apocalyptic number.
It is an amenable number.
10160160665 is a deficient number, since it is larger than the sum of its proper divisors (2032032139).
10160160665 is an equidigital number, since it uses as much as digits as its factorization.
10160160665 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2032032138.
The product of its (nonzero) digits is 6480, while the sum is 32.
Adding to 10160160665 its reverse (56606106101), we get a palindrome (66766266766).
The spelling of 10160160665 in words is "ten billion, one hundred sixty million, one hundred sixty thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •