Base | Representation |
---|---|
bin | 100101011110110000… |
… | …010010101101110001 |
3 | 10211212200222112120002 |
4 | 211132300102231301 |
5 | 1124410033023122 |
6 | 30253225355345 |
7 | 2623202645603 |
oct | 453660225561 |
9 | 124780875502 |
10 | 40244423537 |
11 | 16081a2306a |
12 | 7971938b55 |
13 | 3a448c1986 |
14 | 1d3ac35173 |
15 | 10a81b8992 |
hex | 95ec12b71 |
40244423537 has 2 divisors, whose sum is σ = 40244423538. Its totient is φ = 40244423536.
The previous prime is 40244423521. The next prime is 40244423567. The reversal of 40244423537 is 73532444204.
40244423537 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 can be written as a sum of positive squares in only one way, i.e., 22965583936 + 17278839601 = 151544^2 + 131449^2 .
It is a cyclic number.
It is not a de Polignac number, because 40244423537 - 24 = 40244423521 is a prime.
It is a super-2 number, since 2×402444235372 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 40244423537.
It is not a weakly prime, because it can be changed into another prime (40244423567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20122211768 + 20122211769.
It is an arithmetic number, because the mean of its divisors is an integer number (20122211769).
Almost surely, 240244423537 is an apocalyptic number.
It is an amenable number.
40244423537 is a deficient number, since it is larger than the sum of its proper divisors (1).
40244423537 is an equidigital number, since it uses as much as digits as its factorization.
40244423537 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 322560, while the sum is 38.
The spelling of 40244423537 in words is "forty billion, two hundred forty-four million, four hundred twenty-three thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •