Base | Representation |
---|---|
bin | 10100010011000110… |
… | …11000110001000000 |
3 | 1001010110220222211201 |
4 | 22021203120301000 |
5 | 134304302032124 |
6 | 5001211150544 |
7 | 534024555661 |
oct | 121143306100 |
9 | 31113828751 |
10 | 10897689664 |
11 | 46925095a4 |
12 | 2141745454 |
13 | 10489853a4 |
14 | 75547b368 |
15 | 43bad0144 |
hex | 2898d8c40 |
10897689664 has 21 divisors (see below), whose sum is σ = 21626760277. Its totient is φ = 5448427264.
The previous prime is 10897689659. The next prime is 10897689679. The reversal of 10897689664 is 46698679801.
It is a happy number.
The square root of 10897689664 is 104392.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 6208179264 + 4689510400 = 78792^2 + 68480^2 .
It is a Harshad number since it is a multiple of its sum of digits (64).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10897689596 and 10897689605.
It is an unprimeable number.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 828612 + ... + 841660.
Almost surely, 210897689664 is an apocalyptic number.
10897689664 is the 104392-nd square number.
It is an amenable number.
10897689664 is a deficient number, since it is larger than the sum of its proper divisors (10729070613).
10897689664 is an frugal number, since it uses more digits than its factorization.
10897689664 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26110 (or 13051 counting only the distinct ones).
The product of its (nonzero) digits is 31352832, while the sum is 64.
Multiplying 10897689664 by its sum of digits (64), we get a square (697452138496 = 8351362).
10897689664 divided by its sum of digits (64) gives a square (170276401 = 130492).
The spelling of 10897689664 in words is "ten billion, eight hundred ninety-seven million, six hundred eighty-nine thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •