Base | Representation |
---|---|
bin | 100111100110… |
… | …011010000101 |
3 | 201112101222000 |
4 | 213212122011 |
5 | 10124142213 |
6 | 1010255513 |
7 | 154144053 |
oct | 47463205 |
9 | 21471860 |
10 | 10380933 |
11 | 5950392 |
12 | 3587599 |
13 | 21c6084 |
14 | 15431d3 |
15 | da0c73 |
hex | 9e6685 |
10380933 has 8 divisors (see below), whose sum is σ = 15379200. Its totient is φ = 6920604.
The previous prime is 10380907. The next prime is 10380941. The reversal of 10380933 is 33908301.
10380933 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 not a de Polignac number, because 10380933 - 28 = 10380677 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 384479 = 10380933 / (1 + 0 + 3 + 8 + 0 + 9 + 3 + 3).
It is a junction number, because it is equal to n+sod(n) for n = 10380897 and 10380906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10380233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 192213 + ... + 192266.
It is an arithmetic number, because the mean of its divisors is an integer number (1922400).
Almost surely, 210380933 is an apocalyptic number.
It is an amenable number.
10380933 is a deficient number, since it is larger than the sum of its proper divisors (4998267).
10380933 is an equidigital number, since it uses as much as digits as its factorization.
10380933 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 384488 (or 384482 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
The square root of 10380933 is about 3221.9455302658. The cubic root of 10380933 is about 218.1451002131.
The spelling of 10380933 in words is "ten million, three hundred eighty thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •