Base | Representation |
---|---|
bin | 10010010000000100010001… |
… | …00001111011111011110001 |
3 | 12021002211001212120100011102 |
4 | 21020002020201323323301 |
5 | 20230030341020331231 |
6 | 221205304012054145 |
7 | 11311422312555113 |
oct | 1110021041737361 |
9 | 167084055510142 |
10 | 40134465011441 |
11 | 11873a272173a9 |
12 | 46023b3164355 |
13 | 19518825152a8 |
14 | 9ca7389833b3 |
15 | 498ec9a5bacb |
hex | 24808887bef1 |
40134465011441 has 2 divisors, whose sum is σ = 40134465011442. Its totient is φ = 40134465011440.
The previous prime is 40134465011413. The next prime is 40134465011449. The reversal of 40134465011441 is 14411056443104.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39595115776225 + 539349235216 = 6292465^2 + 734404^2 .
It is a cyclic number.
It is not a de Polignac number, because 40134465011441 - 214 = 40134464995057 is a prime.
It is a super-2 number, since 2×401344650114412 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40134465011395 and 40134465011404.
It is not a weakly prime, because it can be changed into another prime (40134465011449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20067232505720 + 20067232505721.
It is an arithmetic number, because the mean of its divisors is an integer number (20067232505721).
Almost surely, 240134465011441 is an apocalyptic number.
It is an amenable number.
40134465011441 is a deficient number, since it is larger than the sum of its proper divisors (1).
40134465011441 is an equidigital number, since it uses as much as digits as its factorization.
40134465011441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 92160, while the sum is 38.
The spelling of 40134465011441 in words is "forty trillion, one hundred thirty-four billion, four hundred sixty-five million, eleven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •