Base | Representation |
---|---|
bin | 10010010010101001110000… |
… | …10010001010010110011001 |
3 | 12021102022101211202102022021 |
4 | 21021110320102022112121 |
5 | 20233004321112341441 |
6 | 221314200201054441 |
7 | 11321016123243061 |
oct | 1111247022122631 |
9 | 167368354672267 |
10 | 40223313012121 |
11 | 118a867a637338 |
12 | 461766a187421 |
13 | 195a07177b465 |
14 | 9d0b668883a1 |
15 | 49b479bd03d1 |
hex | 24953848a599 |
40223313012121 has 2 divisors, whose sum is σ = 40223313012122. Its totient is φ = 40223313012120.
The previous prime is 40223313012049. The next prime is 40223313012139. The reversal of 40223313012121 is 12121031332204.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21097385189721 + 19125927822400 = 4593189^2 + 4373320^2 .
It is a cyclic number.
It is not a de Polignac number, because 40223313012121 - 219 = 40223312487833 is a prime.
It is not a weakly prime, because it can be changed into another prime (40223313012151) 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, 20111656506060 + 20111656506061.
It is an arithmetic number, because the mean of its divisors is an integer number (20111656506061).
Almost surely, 240223313012121 is an apocalyptic number.
It is an amenable number.
40223313012121 is a deficient number, since it is larger than the sum of its proper divisors (1).
40223313012121 is an equidigital number, since it uses as much as digits as its factorization.
40223313012121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 40223313012121 its reverse (12121031332204), we get a palindrome (52344344344325).
The spelling of 40223313012121 in words is "forty trillion, two hundred twenty-three billion, three hundred thirteen million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •