Base | Representation |
---|---|
bin | 10010010100010110001010… |
… | …00101001001000101011001 |
3 | 12021121212121200012121001121 |
4 | 21022023011011021011121 |
5 | 20234433012444330434 |
6 | 221401023051245241 |
7 | 11325146235404002 |
oct | 1112130505110531 |
9 | 167555550177047 |
10 | 40281509761369 |
11 | 1192032413a418 |
12 | 46269b0149821 |
13 | 19626b774aa66 |
14 | 9d38c7a5a1a9 |
15 | 49cc33e867b4 |
hex | 24a2c5149159 |
40281509761369 has 2 divisors, whose sum is σ = 40281509761370. Its totient is φ = 40281509761368.
The previous prime is 40281509761327. The next prime is 40281509761439. The reversal of 40281509761369 is 96316790518204.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39011579105625 + 1269930655744 = 6245925^2 + 1126912^2 .
It is a cyclic number.
It is not a de Polignac number, because 40281509761369 - 215 = 40281509728601 is a prime.
It is a super-2 number, since 2×402815097613692 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40281509761469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20140754880684 + 20140754880685.
It is an arithmetic number, because the mean of its divisors is an integer number (20140754880685).
It is a 1-persistent number, because it is pandigital, but 2⋅40281509761369 = 80563019522738 is not.
Almost surely, 240281509761369 is an apocalyptic number.
It is an amenable number.
40281509761369 is a deficient number, since it is larger than the sum of its proper divisors (1).
40281509761369 is an equidigital number, since it uses as much as digits as its factorization.
40281509761369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 19595520, while the sum is 61.
The spelling of 40281509761369 in words is "forty trillion, two hundred eighty-one billion, five hundred nine million, seven hundred sixty-one thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •