Base | Representation |
---|---|
bin | 100101101010011011… |
… | …111000110101010001 |
3 | 10212101100202020102021 |
4 | 211222123320311101 |
5 | 1130310220314413 |
6 | 30324510051441 |
7 | 2631102511261 |
oct | 455233706521 |
9 | 125340666367 |
10 | 40440401233 |
11 | 16172609001 |
12 | 7a074a9b81 |
13 | 3a7639b1cb |
14 | 1d58c8b7a1 |
15 | 10ba4cb18d |
hex | 96a6f8d51 |
40440401233 has 2 divisors, whose sum is σ = 40440401234. Its totient is φ = 40440401232.
The previous prime is 40440401231. The next prime is 40440401237. The reversal of 40440401233 is 33210404404.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 32116940944 + 8323460289 = 179212^2 + 91233^2 .
It is a cyclic number.
It is not a de Polignac number, because 40440401233 - 21 = 40440401231 is a prime.
Together with 40440401231, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 40440401198 and 40440401207.
It is not a weakly prime, because it can be changed into another prime (40440401231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20220200616 + 20220200617.
It is an arithmetic number, because the mean of its divisors is an integer number (20220200617).
Almost surely, 240440401233 is an apocalyptic number.
It is an amenable number.
40440401233 is a deficient number, since it is larger than the sum of its proper divisors (1).
40440401233 is an equidigital number, since it uses as much as digits as its factorization.
40440401233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 40440401233 its reverse (33210404404), we get a palindrome (73650805637).
The spelling of 40440401233 in words is "forty billion, four hundred forty million, four hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •