Base | Representation |
---|---|
bin | 100101011000000011… |
… | …100010111001111001 |
3 | 10211120212111100201012 |
4 | 211120003202321321 |
5 | 1124142244430243 |
6 | 30234132403305 |
7 | 2620336425062 |
oct | 453003427171 |
9 | 124525440635 |
10 | 40132030073 |
11 | 16024537203 |
12 | 7940176535 |
13 | 3a2752c075 |
14 | 1d29d39569 |
15 | 109d3b6d18 |
hex | 9580e2e79 |
40132030073 has 2 divisors, whose sum is σ = 40132030074. Its totient is φ = 40132030072.
The previous prime is 40132030069. The next prime is 40132030087. The reversal of 40132030073 is 37003023104.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29171615209 + 10960414864 = 170797^2 + 104692^2 .
It is a cyclic number.
It is not a de Polignac number, because 40132030073 - 22 = 40132030069 is a prime.
It is a super-2 number, since 2×401320300732 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (40132036073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20066015036 + 20066015037.
It is an arithmetic number, because the mean of its divisors is an integer number (20066015037).
Almost surely, 240132030073 is an apocalyptic number.
It is an amenable number.
40132030073 is a deficient number, since it is larger than the sum of its proper divisors (1).
40132030073 is an equidigital number, since it uses as much as digits as its factorization.
40132030073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 23.
Adding to 40132030073 its reverse (37003023104), we get a palindrome (77135053177).
The spelling of 40132030073 in words is "forty billion, one hundred thirty-two million, thirty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •