Base | Representation |
---|---|
bin | 10010001101011000001111… |
… | …11011110111001000000011 |
3 | 12020202222200201101221002002 |
4 | 21012230013323313020003 |
5 | 20222022221441432121 |
6 | 221055032021014215 |
7 | 11301642615445622 |
oct | 1106540773671003 |
9 | 166688621357062 |
10 | 40042113233411 |
11 | 1183884602a703 |
12 | 45a851a85436b |
13 | 1945c553bc3a3 |
14 | 9c60975b96b9 |
15 | 4968c1ed1e0b |
hex | 246b07ef7203 |
40042113233411 has 2 divisors, whose sum is σ = 40042113233412. Its totient is φ = 40042113233410.
The previous prime is 40042113233389. The next prime is 40042113233417. The reversal of 40042113233411 is 11433231124004.
40042113233411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 40042113233411 - 226 = 40042046124547 is a prime.
It is not a weakly prime, because it can be changed into another prime (40042113233417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20021056616705 + 20021056616706.
It is an arithmetic number, because the mean of its divisors is an integer number (20021056616706).
Almost surely, 240042113233411 is an apocalyptic number.
40042113233411 is a deficient number, since it is larger than the sum of its proper divisors (1).
40042113233411 is an equidigital number, since it uses as much as digits as its factorization.
40042113233411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 40042113233411 its reverse (11433231124004), we get a palindrome (51475344357415).
The spelling of 40042113233411 in words is "forty trillion, forty-two billion, one hundred thirteen million, two hundred thirty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •