Base | Representation |
---|---|
bin | 10010010000001001110001… |
… | …10110010110111100111101 |
3 | 12021010002201000211121021011 |
4 | 21020010320312112330331 |
5 | 20230102420311430010 |
6 | 221210513323235221 |
7 | 11311555522431301 |
oct | 1110047066267475 |
9 | 167102630747234 |
10 | 40137423155005 |
11 | 11875204a99450 |
12 | 4602a99978b11 |
13 | 1951c34332cb7 |
14 | 9ca9397b1d01 |
15 | 4990ee5d3a8a |
hex | 248138d96f3d |
40137423155005 has 16 divisors (see below), whose sum is σ = 52543780072704. Its totient is φ = 29190717478080.
The previous prime is 40137423154991. The next prime is 40137423155033. The reversal of 40137423155005 is 50055132473104.
40137423155005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 40137423155005 - 217 = 40137423023933 is a prime.
It is a super-2 number, since 2×401374231550052 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 11110999 + ... + 14273371.
It is an arithmetic number, because the mean of its divisors is an integer number (3283986254544).
Almost surely, 240137423155005 is an apocalyptic number.
It is an amenable number.
40137423155005 is a deficient number, since it is larger than the sum of its proper divisors (12406356917699).
40137423155005 is a wasteful number, since it uses less digits than its factorization.
40137423155005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3393156.
The product of its (nonzero) digits is 252000, while the sum is 40.
The spelling of 40137423155005 in words is "forty trillion, one hundred thirty-seven billion, four hundred twenty-three million, one hundred fifty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •