Base | Representation |
---|---|
bin | 100111100110… |
… | …110000110111 |
3 | 201112110222000 |
4 | 213212300313 |
5 | 10124214031 |
6 | 1010310343 |
7 | 154151235 |
oct | 47466067 |
9 | 21473860 |
10 | 10382391 |
11 | 5951498 |
12 | 35883b3 |
13 | 21c6936 |
14 | 1543955 |
15 | da13e6 |
hex | 9e6c37 |
10382391 has 8 divisors (see below), whose sum is σ = 15381360. Its totient is φ = 6921576.
The previous prime is 10382369. The next prime is 10382413. The reversal of 10382391 is 19328301.
10382391 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10382369) and next prime (10382413).
It is not a de Polignac number, because 10382391 - 27 = 10382263 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: 384533 = 10382391 / (1 + 0 + 3 + 8 + 2 + 3 + 9 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10382191) 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, 192240 + ... + 192293.
It is an arithmetic number, because the mean of its divisors is an integer number (1922670).
Almost surely, 210382391 is an apocalyptic number.
10382391 is a deficient number, since it is larger than the sum of its proper divisors (4998969).
10382391 is an equidigital number, since it uses as much as digits as its factorization.
10382391 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 384542 (or 384536 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 10382391 is about 3222.1717831301. The cubic root of 10382391 is about 218.1553125472.
The spelling of 10382391 in words is "ten million, three hundred eighty-two thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •