Base | Representation |
---|---|
bin | 10010011000011101111111… |
… | …01100001001011110110001 |
3 | 12022010102020001102001020212 |
4 | 21030032333230021132301 |
5 | 20244243104212302311 |
6 | 221550050142513505 |
7 | 11341322264215046 |
oct | 1114167754113661 |
9 | 168112201361225 |
10 | 40423153244081 |
11 | 119753aa1a4433 |
12 | 464a340295895 |
13 | 1972b6b95b61a |
14 | 9da6c365b1cd |
15 | 4a17740e5c8b |
hex | 24c3bfb097b1 |
40423153244081 has 2 divisors, whose sum is σ = 40423153244082. Its totient is φ = 40423153244080.
The previous prime is 40423153244077. The next prime is 40423153244099. The reversal of 40423153244081 is 18044235132404.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39490352698225 + 932800545856 = 6284135^2 + 965816^2 .
It is a cyclic number.
It is not a de Polignac number, because 40423153244081 - 22 = 40423153244077 is a prime.
It is a super-2 number, since 2×404231532440812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40423153244381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20211576622040 + 20211576622041.
It is an arithmetic number, because the mean of its divisors is an integer number (20211576622041).
Almost surely, 240423153244081 is an apocalyptic number.
It is an amenable number.
40423153244081 is a deficient number, since it is larger than the sum of its proper divisors (1).
40423153244081 is an equidigital number, since it uses as much as digits as its factorization.
40423153244081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 368640, while the sum is 41.
Adding to 40423153244081 its reverse (18044235132404), we get a palindrome (58467388376485).
The spelling of 40423153244081 in words is "forty trillion, four hundred twenty-three billion, one hundred fifty-three million, two hundred forty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •