Base | Representation |
---|---|
bin | 100001010101100010001… |
… | …0100011000101111000101 |
3 | 121020000020120002102222102 |
4 | 1002223010110120233011 |
5 | 1100031340034103234 |
6 | 13424452301241445 |
7 | 652006340234246 |
oct | 102530424305705 |
9 | 17200216072872 |
10 | 4581728816069 |
11 | 1507111520259 |
12 | 61bb77863285 |
13 | 2730942a69b2 |
14 | 11ba84b64ccd |
15 | 7e2abc53c7e |
hex | 42ac4518bc5 |
4581728816069 has 2 divisors, whose sum is σ = 4581728816070. Its totient is φ = 4581728816068.
The previous prime is 4581728815991. The next prime is 4581728816087. The reversal of 4581728816069 is 9606188271854.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4183100739169 + 398628076900 = 2045263^2 + 631370^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4581728816069 is a prime.
It is a super-2 number, since 2×45817288160692 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4581728815996 and 4581728816014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4581728816369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2290864408034 + 2290864408035.
It is an arithmetic number, because the mean of its divisors is an integer number (2290864408035).
Almost surely, 24581728816069 is an apocalyptic number.
It is an amenable number.
4581728816069 is a deficient number, since it is larger than the sum of its proper divisors (1).
4581728816069 is an equidigital number, since it uses as much as digits as its factorization.
4581728816069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 46448640, while the sum is 65.
The spelling of 4581728816069 in words is "four trillion, five hundred eighty-one billion, seven hundred twenty-eight million, eight hundred sixteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •