Base | Representation |
---|---|
bin | 1001100111010… |
… | …0011000100001 |
3 | 2210212121012101 |
4 | 2121310120201 |
5 | 40310310333 |
6 | 4000130401 |
7 | 666510403 |
oct | 231643041 |
9 | 83777171 |
10 | 40322593 |
11 | 20840a63 |
12 | 11606a01 |
13 | 847a62c |
14 | 54d8b73 |
15 | 381767d |
hex | 2674621 |
40322593 has 2 divisors, whose sum is σ = 40322594. Its totient is φ = 40322592.
The previous prime is 40322539. The next prime is 40322603. The reversal of 40322593 is 39522304.
Together with previous prime (40322539) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33315984 + 7006609 = 5772^2 + 2647^2 .
It is a cyclic number.
It is not a de Polignac number, because 40322593 - 29 = 40322081 is a prime.
It is a super-4 number, since 4×403225934 (a number of 32 digits) contains 4444 as substring.
It is not a weakly prime, because it can be changed into another prime (40322993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20161296 + 20161297.
It is an arithmetic number, because the mean of its divisors is an integer number (20161297).
Almost surely, 240322593 is an apocalyptic number.
It is an amenable number.
40322593 is a deficient number, since it is larger than the sum of its proper divisors (1).
40322593 is an equidigital number, since it uses as much as digits as its factorization.
40322593 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 40322593 is about 6350.0073228304. The cubic root of 40322593 is about 342.9121059289.
Adding to 40322593 its reverse (39522304), we get a palindrome (79844897).
The spelling of 40322593 in words is "forty million, three hundred twenty-two thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •