Base | Representation |
---|---|
bin | 10010011110100110111001… |
… | …01100000111000110001011 |
3 | 12022212120200211002121022211 |
4 | 21033103130230013012023 |
5 | 20311222110322433313 |
6 | 222231013353325551 |
7 | 11362500465055006 |
oct | 1117233454070613 |
9 | 168776624077284 |
10 | 40634093171083 |
11 | 11a469052a2715 |
12 | 46831ab7068b7 |
13 | 1989a17600b89 |
14 | a069b465253d |
15 | 4a6ebcbdee3d |
hex | 24f4dcb0718b |
40634093171083 has 2 divisors, whose sum is σ = 40634093171084. Its totient is φ = 40634093171082.
The previous prime is 40634093171059. The next prime is 40634093171117. The reversal of 40634093171083 is 38017139043604.
It is a happy number.
40634093171083 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 40634093171083 - 233 = 40625503236491 is a prime.
It is a super-2 number, since 2×406340931710832 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40634013171083) 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, 20317046585541 + 20317046585542.
It is an arithmetic number, because the mean of its divisors is an integer number (20317046585542).
Almost surely, 240634093171083 is an apocalyptic number.
40634093171083 is a deficient number, since it is larger than the sum of its proper divisors (1).
40634093171083 is an equidigital number, since it uses as much as digits as its factorization.
40634093171083 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1306368, while the sum is 49.
The spelling of 40634093171083 in words is "forty trillion, six hundred thirty-four billion, ninety-three million, one hundred seventy-one thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •