Base | Representation |
---|---|
bin | 100101011000000100… |
… | …010010000001110101 |
3 | 10211120212212011111002 |
4 | 211120010102001311 |
5 | 1124142322114333 |
6 | 30234140453045 |
7 | 2620341160604 |
oct | 453004220165 |
9 | 124525764432 |
10 | 40132223093 |
11 | 16024659226 |
12 | 794024a185 |
13 | 3a27598b91 |
14 | 1d29d89a3b |
15 | 109d4040e8 |
hex | 958112075 |
40132223093 has 2 divisors, whose sum is σ = 40132223094. Its totient is φ = 40132223092.
The previous prime is 40132223083. The next prime is 40132223107. The reversal of 40132223093 is 39032223104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39871303684 + 260919409 = 199678^2 + 16153^2 .
It is a cyclic number.
It is not a de Polignac number, because 40132223093 - 24 = 40132223077 is a prime.
It is a super-3 number, since 3×401322230933 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40132223063) 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, 20066111546 + 20066111547.
It is an arithmetic number, because the mean of its divisors is an integer number (20066111547).
Almost surely, 240132223093 is an apocalyptic number.
It is an amenable number.
40132223093 is a deficient number, since it is larger than the sum of its proper divisors (1).
40132223093 is an equidigital number, since it uses as much as digits as its factorization.
40132223093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 40132223093 its reverse (39032223104), we get a palindrome (79164446197).
The spelling of 40132223093 in words is "forty billion, one hundred thirty-two million, two hundred twenty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.184 sec. • engine limits •