Base | Representation |
---|---|
bin | 101100100110… |
… | …011111100010 |
3 | 211000000102010 |
4 | 230212133202 |
5 | 10443121002 |
6 | 1054333350 |
7 | 201244320 |
oct | 54463742 |
9 | 24000363 |
10 | 11692002 |
11 | 6666413 |
12 | 3aba256 |
13 | 2564a5a |
14 | 17a4d10 |
15 | 105e46c |
hex | b267e2 |
11692002 has 32 divisors (see below), whose sum is σ = 27297792. Its totient is φ = 3268944.
The previous prime is 11691989. The next prime is 11692003. The reversal of 11692002 is 20029611.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 11692002.
It is not an unprimeable number, because it can be changed into a prime (11692003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 988 + ... + 4935.
It is an arithmetic number, because the mean of its divisors is an integer number (853056).
Almost surely, 211692002 is an apocalyptic number.
11692002 is an abundant number, since it is smaller than the sum of its proper divisors (15605790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11692002 is a wasteful number, since it uses less digits than its factorization.
11692002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5982.
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 11692002 is about 3419.3569570900. The cubic root of 11692002 is about 226.9671270167.
The spelling of 11692002 in words is "eleven million, six hundred ninety-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •