Base | Representation |
---|---|
bin | 101000011010… |
… | …111100000001 |
3 | 201221100010001 |
4 | 220122330001 |
5 | 10203033342 |
6 | 1015040001 |
7 | 156031261 |
oct | 50327401 |
9 | 21840101 |
10 | 10596097 |
11 | 5a88006 |
12 | 3670001 |
13 | 226cca5 |
14 | 159b7a1 |
15 | de48b7 |
hex | a1af01 |
10596097 has 4 divisors (see below), whose sum is σ = 10882516. Its totient is φ = 10309680.
The previous prime is 10596071. The next prime is 10596101. The reversal of 10596097 is 79069501.
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 10042561 + 553536 = 3169^2 + 744^2 .
It is not a de Polignac number, because 10596097 - 223 = 2207489 is a prime.
It is a super-2 number, since 2×105960972 = 224554543266818, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37), and also a Moran number because the ratio is a prime number: 286381 = 10596097 / (1 + 0 + 5 + 9 + 6 + 0 + 9 + 7).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10596037) 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, 143154 + ... + 143227.
It is an arithmetic number, because the mean of its divisors is an integer number (2720629).
Almost surely, 210596097 is an apocalyptic number.
It is an amenable number.
10596097 is a deficient number, since it is larger than the sum of its proper divisors (286419).
10596097 is an equidigital number, since it uses as much as digits as its factorization.
10596097 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 286418.
The product of its (nonzero) digits is 17010, while the sum is 37.
The square root of 10596097 is about 3255.1646655738. The cubic root of 10596097 is about 219.6419589411.
The spelling of 10596097 in words is "ten million, five hundred ninety-six thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •