Base | Representation |
---|---|
bin | 101111000001101001100101… |
… | …1110110100100011011111101 |
3 | 2000020120220012222010012111222 |
4 | 1132003103023312210123331 |
5 | 413204112112342014122 |
6 | 4023425010352323125 |
7 | 153061505244050444 |
oct | 13603231366443375 |
9 | 2006526188105458 |
10 | 413643130423037 |
11 | 10a8880805190a9 |
12 | 3a4869875434a5 |
13 | 149a64c2633638 |
14 | 7420611b57d5b |
15 | 32c4c18d72b42 |
hex | 17834cbda46fd |
413643130423037 has 2 divisors, whose sum is σ = 413643130423038. Its totient is φ = 413643130423036.
The previous prime is 413643130422979. The next prime is 413643130423099. The reversal of 413643130423037 is 730324031346314.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 374351721045241 + 39291409377796 = 19348171^2 + 6268286^2 .
It is a cyclic number.
It is not a de Polignac number, because 413643130423037 - 218 = 413643130160893 is a prime.
It is a super-2 number, since 2×4136431304230372 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (413643130423637) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206821565211518 + 206821565211519.
It is an arithmetic number, because the mean of its divisors is an integer number (206821565211519).
Almost surely, 2413643130423037 is an apocalyptic number.
It is an amenable number.
413643130423037 is a deficient number, since it is larger than the sum of its proper divisors (1).
413643130423037 is an equidigital number, since it uses as much as digits as its factorization.
413643130423037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1306368, while the sum is 44.
The spelling of 413643130423037 in words is "four hundred thirteen trillion, six hundred forty-three billion, one hundred thirty million, four hundred twenty-three thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •