Base | Representation |
---|---|
bin | 1011101100001010010101 |
3 | 12202200122212 |
4 | 23230022111 |
5 | 1241030334 |
6 | 145403205 |
7 | 35022212 |
oct | 13541225 |
9 | 5680585 |
10 | 3064469 |
11 | 1803421 |
12 | 1039505 |
13 | 833ac5 |
14 | 59ab09 |
15 | 407ece |
hex | 2ec295 |
3064469 has 2 divisors, whose sum is σ = 3064470. Its totient is φ = 3064468.
The previous prime is 3064433. The next prime is 3064493. The reversal of 3064469 is 9644603.
3064469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1787569 + 1276900 = 1337^2 + 1130^2 .
It is a cyclic number.
It is not a de Polignac number, because 3064469 - 212 = 3060373 is a prime.
It is a super-2 number, since 2×30644692 = 18781940503922, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3064429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1532234 + 1532235.
It is an arithmetic number, because the mean of its divisors is an integer number (1532235).
Almost surely, 23064469 is an apocalyptic number.
It is an amenable number.
3064469 is a deficient number, since it is larger than the sum of its proper divisors (1).
3064469 is an equidigital number, since it uses as much as digits as its factorization.
3064469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
The square root of 3064469 is about 1750.5624810329. The cubic root of 3064469 is about 145.2507591181.
The spelling of 3064469 in words is "three million, sixty-four thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •