Base | Representation |
---|---|
bin | 10010010000000000001011… |
… | …10011010100011001110111 |
3 | 12021002121102000120020221202 |
4 | 21020000011303110121313 |
5 | 20230011343032042243 |
6 | 221204302223003115 |
7 | 11311314051304115 |
oct | 1110000563243167 |
9 | 167077360506852 |
10 | 40132271752823 |
11 | 11873001181778 |
12 | 4601aa073949b |
13 | 19515c3004223 |
14 | 9ca5ab57cab5 |
15 | 498dec2224b8 |
hex | 248005cd4677 |
40132271752823 has 2 divisors, whose sum is σ = 40132271752824. Its totient is φ = 40132271752822.
The previous prime is 40132271752763. The next prime is 40132271752891. The reversal of 40132271752823 is 32825717223104.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 40132271752823 - 212 = 40132271748727 is a prime.
It is a super-2 number, since 2×401322717528232 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40132271751823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20066135876411 + 20066135876412.
It is an arithmetic number, because the mean of its divisors is an integer number (20066135876412).
Almost surely, 240132271752823 is an apocalyptic number.
40132271752823 is a deficient number, since it is larger than the sum of its proper divisors (1).
40132271752823 is an equidigital number, since it uses as much as digits as its factorization.
40132271752823 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1128960, while the sum is 47.
Adding to 40132271752823 its reverse (32825717223104), we get a palindrome (72957988975927).
The spelling of 40132271752823 in words is "forty trillion, one hundred thirty-two billion, two hundred seventy-one million, seven hundred fifty-two thousand, eight hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •