Base | Representation |
---|---|
bin | 11000001001010… |
… | …110100111001101 |
3 | 1001020021110201122 |
4 | 120021112213031 |
5 | 1312201330401 |
6 | 104110450325 |
7 | 13016223302 |
oct | 3011264715 |
9 | 1036243648 |
10 | 405105101 |
11 | 198742505 |
12 | b38039a5 |
13 | 65c0b17b |
14 | 3bb330a9 |
15 | 2587121b |
hex | 182569cd |
405105101 has 2 divisors, whose sum is σ = 405105102. Its totient is φ = 405105100.
The previous prime is 405105097. The next prime is 405105131. The reversal of 405105101 is 101501504.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 402042601 + 3062500 = 20051^2 + 1750^2 .
It is a cyclic number.
It is not a de Polignac number, because 405105101 - 22 = 405105097 is a prime.
It is a super-2 number, since 2×4051051012 = 328220285712440402, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 405105101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (405105131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 202552550 + 202552551.
It is an arithmetic number, because the mean of its divisors is an integer number (202552551).
Almost surely, 2405105101 is an apocalyptic number.
It is an amenable number.
405105101 is a deficient number, since it is larger than the sum of its proper divisors (1).
405105101 is an equidigital number, since it uses as much as digits as its factorization.
405105101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 405105101 is about 20127.2228834482. Note that the first 3 decimals coincide. The cubic root of 405105101 is about 739.9276170983.
Adding to 405105101 its reverse (101501504), we get a palindrome (506606605).
The spelling of 405105101 in words is "four hundred five million, one hundred five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •