Base | Representation |
---|---|
bin | 100001010101100010001… |
… | …1011010111011010100101 |
3 | 121020000020200112101201101 |
4 | 1002223010123113122211 |
5 | 1100031341021130134 |
6 | 13424452404400101 |
7 | 652006361624332 |
oct | 102530433273245 |
9 | 17200220471641 |
10 | 4581730645669 |
11 | 150711255a921 |
12 | 61bb783a6031 |
13 | 2730947976b8 |
14 | 11ba850bd989 |
15 | 7e2abeb5e14 |
hex | 42ac46d76a5 |
4581730645669 has 2 divisors, whose sum is σ = 4581730645670. Its totient is φ = 4581730645668.
The previous prime is 4581730645631. The next prime is 4581730645703. The reversal of 4581730645669 is 9665460371854.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4519395536769 + 62335108900 = 2125887^2 + 249670^2 .
It is a cyclic number.
It is not a de Polignac number, because 4581730645669 - 223 = 4581722257061 is a prime.
It is a super-2 number, since 2×45817306456692 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4581730645669.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4581730645169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2290865322834 + 2290865322835.
It is an arithmetic number, because the mean of its divisors is an integer number (2290865322835).
Almost surely, 24581730645669 is an apocalyptic number.
It is an amenable number.
4581730645669 is a deficient number, since it is larger than the sum of its proper divisors (1).
4581730645669 is an equidigital number, since it uses as much as digits as its factorization.
4581730645669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 130636800, while the sum is 64.
The spelling of 4581730645669 in words is "four trillion, five hundred eighty-one billion, seven hundred thirty million, six hundred forty-five thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •