Base | Representation |
---|---|
bin | 101001110001… |
… | …000110101101 |
3 | 202121021020220 |
4 | 221301012231 |
5 | 10300332122 |
6 | 1030401553 |
7 | 162031251 |
oct | 51610655 |
9 | 22537226 |
10 | 10949037 |
11 | 61a91a0 |
12 | 38002b9 |
13 | 2364828 |
14 | 1650261 |
15 | e6425c |
hex | a711ad |
10949037 has 32 divisors (see below), whose sum is σ = 17470080. Its totient is φ = 6021120.
The previous prime is 10949027. The next prime is 10949039. The reversal of 10949037 is 73094901.
10949037 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10949037 - 210 = 10948013 is a prime.
It is a super-2 number, since 2×109490372 = 239762822454738, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 10948989 and 10949007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10949039) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15933 + ... + 16605.
It is an arithmetic number, because the mean of its divisors is an integer number (545940).
Almost surely, 210949037 is an apocalyptic number.
10949037 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
10949037 is a deficient number, since it is larger than the sum of its proper divisors (6521043).
10949037 is a wasteful number, since it uses less digits than its factorization.
10949037 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 733.
The product of its (nonzero) digits is 6804, while the sum is 33.
The square root of 10949037 is about 3308.9329095647. The cubic root of 10949037 is about 222.0540206173.
The spelling of 10949037 in words is "ten million, nine hundred forty-nine thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •