Base | Representation |
---|---|
bin | 101100100101101001000… |
… | …011100100000000100001 |
3 | 101211220220121020002100112 |
4 | 230211221003210000201 |
5 | 400200211000124044 |
6 | 10303341040301105 |
7 | 434241421112615 |
oct | 54455103440041 |
9 | 11756817202315 |
10 | 3064074223649 |
11 | a8151502331a |
12 | 415a08311795 |
13 | 192c303988ca |
14 | a8432901345 |
15 | 54a849ce09e |
hex | 2c9690e4021 |
3064074223649 has 2 divisors, whose sum is σ = 3064074223650. Its totient is φ = 3064074223648.
The previous prime is 3064074223627. The next prime is 3064074223681. The reversal of 3064074223649 is 9463224704603.
3064074223649 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2156947509025 + 907126714624 = 1468655^2 + 952432^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3064074223649 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3064074223597 and 3064074223606.
It is not a weakly prime, because it can be changed into another prime (3064074223549) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1532037111824 + 1532037111825.
It is an arithmetic number, because the mean of its divisors is an integer number (1532037111825).
Almost surely, 23064074223649 is an apocalyptic number.
It is an amenable number.
3064074223649 is a deficient number, since it is larger than the sum of its proper divisors (1).
3064074223649 is an equidigital number, since it uses as much as digits as its factorization.
3064074223649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5225472, while the sum is 50.
The spelling of 3064074223649 in words is "three trillion, sixty-four billion, seventy-four million, two hundred twenty-three thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •