Base | Representation |
---|---|
bin | 10011110111010100… |
… | …10111111101101001 |
3 | 1000112020101212022001 |
4 | 21323222113331221 |
5 | 133320121442421 |
6 | 4522124131001 |
7 | 525164642644 |
oct | 117352277551 |
9 | 30466355261 |
10 | 10664640361 |
11 | 4582a03171 |
12 | 2097696a61 |
13 | 100c5c91ab |
14 | 732534a5b |
15 | 4263e8691 |
hex | 27ba97f69 |
10664640361 has 4 divisors (see below), whose sum is σ = 10666300500. Its totient is φ = 10662980224.
The previous prime is 10664640353. The next prime is 10664640373. The reversal of 10664640361 is 16304646601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9964032400 + 700607961 = 99820^2 + 26469^2 .
It is a cyclic number.
It is not a de Polignac number, because 10664640361 - 23 = 10664640353 is a prime.
It is a super-2 number, since 2×106646403612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10664640361.
It is not an unprimeable number, because it can be changed into a prime (10664640341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 820396 + ... + 833293.
It is an arithmetic number, because the mean of its divisors is an integer number (2666575125).
Almost surely, 210664640361 is an apocalyptic number.
It is an amenable number.
10664640361 is a deficient number, since it is larger than the sum of its proper divisors (1660139).
10664640361 is an equidigital number, since it uses as much as digits as its factorization.
10664640361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1660138.
The product of its (nonzero) digits is 62208, while the sum is 37.
The spelling of 10664640361 in words is "ten billion, six hundred sixty-four million, six hundred forty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •