Base | Representation |
---|---|
bin | 101001010000… |
… | …001000101101 |
3 | 202100102000102 |
4 | 221100020231 |
5 | 10232021442 |
6 | 1023440445 |
7 | 160626455 |
oct | 51201055 |
9 | 22312012 |
10 | 10813997 |
11 | 6116797 |
12 | 3756125 |
13 | 231821c |
14 | 1616d65 |
15 | e39232 |
hex | a5022d |
10813997 has 4 divisors (see below), whose sum is σ = 10836000. Its totient is φ = 10791996.
The previous prime is 10813981. The next prime is 10814017. The reversal of 10813997 is 79931801.
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, and also an emirpimes, since its reverse is a distinct semiprime: 79931801 = 29 ⋅2756269.
It is a cyclic number.
It is not a de Polignac number, because 10813997 - 24 = 10813981 is a prime.
It is a super-2 number, since 2×108139972 = 233885062232018, which 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 10813997.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10813937) 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, 10247 + ... + 11252.
It is an arithmetic number, because the mean of its divisors is an integer number (2709000).
Almost surely, 210813997 is an apocalyptic number.
It is an amenable number.
10813997 is a deficient number, since it is larger than the sum of its proper divisors (22003).
10813997 is an equidigital number, since it uses as much as digits as its factorization.
10813997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22002.
The product of its (nonzero) digits is 13608, while the sum is 38.
The square root of 10813997 is about 3288.4642312180. The cubic root of 10813997 is about 221.1373401561.
The spelling of 10813997 in words is "ten million, eight hundred thirteen thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •