Base | Representation |
---|---|
bin | 101000101010… |
… | …110011101001 |
3 | 202001122021110 |
4 | 220222303221 |
5 | 10212123342 |
6 | 1020300533 |
7 | 156421626 |
oct | 50526351 |
9 | 22048243 |
10 | 10661097 |
11 | 6021927 |
12 | 36a1749 |
13 | 2293755 |
14 | 15b734d |
15 | e08c9c |
hex | a2ace9 |
10661097 has 4 divisors (see below), whose sum is σ = 14214800. Its totient is φ = 7107396.
The previous prime is 10661089. The next prime is 10661111. The reversal of 10661097 is 79016601.
10661097 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 10661097 - 23 = 10661089 is a prime.
It is a super-2 number, since 2×106610972 = 227317978486818, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10661087) 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, 1776847 + ... + 1776852.
It is an arithmetic number, because the mean of its divisors is an integer number (3553700).
Almost surely, 210661097 is an apocalyptic number.
It is an amenable number.
10661097 is a deficient number, since it is larger than the sum of its proper divisors (3553703).
10661097 is an equidigital number, since it uses as much as digits as its factorization.
10661097 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3553702.
The product of its (nonzero) digits is 2268, while the sum is 30.
The square root of 10661097 is about 3265.1335347884. The cubic root of 10661097 is about 220.0901627680.
Adding to 10661097 its reverse (79016601), we get a palindrome (89677698).
The spelling of 10661097 in words is "ten million, six hundred sixty-one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •