Base | Representation |
---|---|
bin | 110001000111101010010111… |
… | …1001011010010010110011101 |
3 | 2002122210200112221020110201122 |
4 | 1202033110233023102112131 |
5 | 423112344142320013423 |
6 | 4130530211100020325 |
7 | 160002264431102021 |
oct | 14217245713222635 |
9 | 2078720487213648 |
10 | 432061616563613 |
11 | 1157393367aa783 |
12 | 405605292316a5 |
13 | 1571130a86355a |
14 | 7899c72900381 |
15 | 34e3daa5098c8 |
hex | 188f52f2d259d |
432061616563613 has 2 divisors, whose sum is σ = 432061616563614. Its totient is φ = 432061616563612.
The previous prime is 432061616563531. The next prime is 432061616563627. The reversal of 432061616563613 is 316365616160234.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 238454066873764 + 193607549689849 = 15441958^2 + 13914293^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-432061616563613 is a prime.
It is a super-2 number, since 2×4320616165636132 (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 (432061616503613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 216030808281806 + 216030808281807.
It is an arithmetic number, because the mean of its divisors is an integer number (216030808281807).
Almost surely, 2432061616563613 is an apocalyptic number.
It is an amenable number.
432061616563613 is a deficient number, since it is larger than the sum of its proper divisors (1).
432061616563613 is an equidigital number, since it uses as much as digits as its factorization.
432061616563613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8398080, while the sum is 53.
The spelling of 432061616563613 in words is "four hundred thirty-two trillion, sixty-one billion, six hundred sixteen million, five hundred sixty-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •