Base | Representation |
---|---|
bin | 10100000111001100… |
… | …11011111001000001 |
3 | 1000212112000101002201 |
4 | 22003212123321001 |
5 | 134103220404401 |
6 | 4543242513201 |
7 | 531403001053 |
oct | 120346337101 |
9 | 30775011081 |
10 | 10797825601 |
11 | 4641100212 |
12 | 2114205801 |
13 | 103108b724 |
14 | 7460c38d3 |
15 | 432e55b01 |
hex | 28399be41 |
10797825601 has 4 divisors (see below), whose sum is σ = 10801236100. Its totient is φ = 10794415104.
The previous prime is 10797825583. The next prime is 10797825607. The reversal of 10797825601 is 10652879701.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10652879701 = 19 ⋅560677879.
It can be written as a sum of positive squares in 2 ways, for example, as 6831849025 + 3965976576 = 82655^2 + 62976^2 .
It is a cyclic number.
It is not a de Polignac number, because 10797825601 - 25 = 10797825569 is a prime.
It is a super-2 number, since 2×107978256012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10797825607) 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, 1700496 + ... + 1706833.
It is an arithmetic number, because the mean of its divisors is an integer number (2700309025).
Almost surely, 210797825601 is an apocalyptic number.
It is an amenable number.
10797825601 is a deficient number, since it is larger than the sum of its proper divisors (3410499).
10797825601 is an equidigital number, since it uses as much as digits as its factorization.
10797825601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3410498.
The product of its (nonzero) digits is 211680, while the sum is 46.
The spelling of 10797825601 in words is "ten billion, seven hundred ninety-seven million, eight hundred twenty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •