Base | Representation |
---|---|
bin | 1011110010100111110… |
… | …01111011101000110001 |
3 | 1102201201112021011011121 |
4 | 11321103321323220301 |
5 | 23114203430334413 |
6 | 510041040542241 |
7 | 41161420314136 |
oct | 5712371735061 |
9 | 1381645234147 |
10 | 405134621233 |
11 | 1468a8a28321 |
12 | 66626921981 |
13 | 2c286342c64 |
14 | 158740a858d |
15 | a812592b8d |
hex | 5e53e7ba31 |
405134621233 has 2 divisors, whose sum is σ = 405134621234. Its totient is φ = 405134621232.
The previous prime is 405134621231. The next prime is 405134621261. The reversal of 405134621233 is 332126431504.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 404759346849 + 375274384 = 636207^2 + 19372^2 .
It is a cyclic number.
It is not a de Polignac number, because 405134621233 - 21 = 405134621231 is a prime.
It is a super-2 number, since 2×4051346212332 (a number of 24 digits) contains 22 as substring.
Together with 405134621231, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (405134621231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 202567310616 + 202567310617.
It is an arithmetic number, because the mean of its divisors is an integer number (202567310617).
Almost surely, 2405134621233 is an apocalyptic number.
It is an amenable number.
405134621233 is a deficient number, since it is larger than the sum of its proper divisors (1).
405134621233 is an equidigital number, since it uses as much as digits as its factorization.
405134621233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 34.
The spelling of 405134621233 in words is "four hundred five billion, one hundred thirty-four million, six hundred twenty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •