Base | Representation |
---|---|
bin | 10010010011100001010100… |
… | …01111001001000001001001 |
3 | 12021112011101200110121102121 |
4 | 21021300222033021001021 |
5 | 20234001413340012111 |
6 | 221340012130131241 |
7 | 11323123246345612 |
oct | 1111605217110111 |
9 | 167464350417377 |
10 | 40253142110281 |
11 | 1190a297362281 |
12 | 46213b3a20b21 |
13 | 195cb166068b9 |
14 | 9d2396326c09 |
15 | 49c1237eb871 |
hex | 249c2a3c9049 |
40253142110281 has 2 divisors, whose sum is σ = 40253142110282. Its totient is φ = 40253142110280.
The previous prime is 40253142110267. The next prime is 40253142110287. The reversal of 40253142110281 is 18201124135204.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23576462913600 + 16676679196681 = 4855560^2 + 4083709^2 .
It is a cyclic number.
It is not a de Polignac number, because 40253142110281 - 25 = 40253142110249 is a prime.
It is a super-2 number, since 2×402531421102812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40253142110287) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20126571055140 + 20126571055141.
It is an arithmetic number, because the mean of its divisors is an integer number (20126571055141).
Almost surely, 240253142110281 is an apocalyptic number.
It is an amenable number.
40253142110281 is a deficient number, since it is larger than the sum of its proper divisors (1).
40253142110281 is an equidigital number, since it uses as much as digits as its factorization.
40253142110281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15360, while the sum is 34.
Adding to 40253142110281 its reverse (18201124135204), we get a palindrome (58454266245485).
The spelling of 40253142110281 in words is "forty trillion, two hundred fifty-three billion, one hundred forty-two million, one hundred ten thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •