Base | Representation |
---|---|
bin | 101110000010110110111110… |
… | …1110001010110000111100001 |
3 | 1222010000212221110002110002122 |
4 | 1130011231331301112013201 |
5 | 411041214044132230103 |
6 | 3553220302040354025 |
7 | 151211145300314636 |
oct | 13405557561260741 |
9 | 1863025843073078 |
10 | 405013231133153 |
11 | 108060168335345 |
12 | 3951233b775915 |
13 | 144cb77884b996 |
14 | 7202a6032418d |
15 | 31c54cc20ab38 |
hex | 1705b7dc561e1 |
405013231133153 has 2 divisors, whose sum is σ = 405013231133154. Its totient is φ = 405013231133152.
The previous prime is 405013231133089. The next prime is 405013231133197. The reversal of 405013231133153 is 351331132310504.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 257778983917009 + 147234247216144 = 16055497^2 + 12134012^2 .
It is a cyclic number.
It is not a de Polignac number, because 405013231133153 - 26 = 405013231133089 is a prime.
It is not a weakly prime, because it can be changed into another prime (405013231133453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 202506615566576 + 202506615566577.
It is an arithmetic number, because the mean of its divisors is an integer number (202506615566577).
Almost surely, 2405013231133153 is an apocalyptic number.
It is an amenable number.
405013231133153 is a deficient number, since it is larger than the sum of its proper divisors (1).
405013231133153 is an equidigital number, since it uses as much as digits as its factorization.
405013231133153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48600, while the sum is 35.
Adding to 405013231133153 its reverse (351331132310504), we get a palindrome (756344363443657).
The spelling of 405013231133153 in words is "four hundred five trillion, thirteen billion, two hundred thirty-one million, one hundred thirty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •