Base | Representation |
---|---|
bin | 10010010010000100010101… |
… | …10001011111011100101001 |
3 | 12021100101112200012100211022 |
4 | 21021002022301133130221 |
5 | 20232142144330321413 |
6 | 221301034423342225 |
7 | 11316405215420204 |
oct | 1111021261373451 |
9 | 167311480170738 |
10 | 40203222120233 |
11 | 118a00aa877957 |
12 | 46137a18b1975 |
13 | 19581bc2cb953 |
14 | 9cdbbc4a293b |
15 | 49aba0ead608 |
hex | 24908ac5f729 |
40203222120233 has 2 divisors, whose sum is σ = 40203222120234. Its totient is φ = 40203222120232.
The previous prime is 40203222120203. The next prime is 40203222120239. The reversal of 40203222120233 is 33202122230204.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32179842961984 + 8023379158249 = 5672728^2 + 2832557^2 .
It is a cyclic number.
It is not a de Polignac number, because 40203222120233 - 212 = 40203222116137 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (40203222120239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20101611060116 + 20101611060117.
It is an arithmetic number, because the mean of its divisors is an integer number (20101611060117).
Almost surely, 240203222120233 is an apocalyptic number.
It is an amenable number.
40203222120233 is a deficient number, since it is larger than the sum of its proper divisors (1).
40203222120233 is an equidigital number, since it uses as much as digits as its factorization.
40203222120233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 40203222120233 its reverse (33202122230204), we get a palindrome (73405344350437).
The spelling of 40203222120233 in words is "forty trillion, two hundred three billion, two hundred twenty-two million, one hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •