Base | Representation |
---|---|
bin | 101001110010… |
… | …110011011001 |
3 | 202121121210112 |
4 | 221302303121 |
5 | 10301042433 |
6 | 1030454105 |
7 | 162060446 |
oct | 51626331 |
9 | 22547715 |
10 | 10955993 |
11 | 6203444 |
12 | 3804335 |
13 | 2367a49 |
14 | 16529cd |
15 | e66348 |
hex | a72cd9 |
10955993 has 2 divisors, whose sum is σ = 10955994. Its totient is φ = 10955992.
The previous prime is 10955983. The next prime is 10956017. The reversal of 10955993 is 39955901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5513104 + 5442889 = 2348^2 + 2333^2 .
It is a cyclic number.
It is not a de Polignac number, because 10955993 - 24 = 10955977 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10955993.
It is not a weakly prime, because it can be changed into another prime (10955953) 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 as a sum of consecutive naturals, namely, 5477996 + 5477997.
It is an arithmetic number, because the mean of its divisors is an integer number (5477997).
Almost surely, 210955993 is an apocalyptic number.
It is an amenable number.
10955993 is a deficient number, since it is larger than the sum of its proper divisors (1).
10955993 is an equidigital number, since it uses as much as digits as its factorization.
10955993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54675, while the sum is 41.
The square root of 10955993 is about 3309.9838368185. The cubic root of 10955993 is about 222.1010348214.
The spelling of 10955993 in words is "ten million, nine hundred fifty-five thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •