Base | Representation |
---|---|
bin | 1100000011010000… |
… | …10010011000101001 |
3 | 121200220001100100011 |
4 | 12001220102120221 |
5 | 101222231223400 |
6 | 2545554011521 |
7 | 316220205154 |
oct | 60150223051 |
9 | 17626040304 |
10 | 6469789225 |
11 | 2820033449 |
12 | 1306876ba1 |
13 | 7c1503c63 |
14 | 45537cc9b |
15 | 27ced48ba |
hex | 181a12629 |
6469789225 has 9 divisors (see below), whose sum is σ = 8023037367. Its totient is φ = 5175509640.
The previous prime is 6469789213. The next prime is 6469789247. The reversal of 6469789225 is 5229879646.
The square root of 6469789225 is 80435.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 2329124121 + 4140665104 = 48261^2 + 64348^2 .
It is not a de Polignac number, because 6469789225 - 221 = 6467692073 is a prime.
It is a super-2 number, since 2×64697892252 = 83716345231852201250, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 6469789225.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 394132 + ... + 410218.
Almost surely, 26469789225 is an apocalyptic number.
6469789225 is the 80435-th square number.
6469789225 is the 40218-th centered octagonal number.
It is an amenable number.
6469789225 is a deficient number, since it is larger than the sum of its proper divisors (1553248142).
6469789225 is an frugal number, since it uses more digits than its factorization.
6469789225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32184 (or 16092 counting only the distinct ones).
The product of its digits is 13063680, while the sum is 58.
The cubic root of 6469789225 is about 1863.3597526095.
The spelling of 6469789225 in words is "six billion, four hundred sixty-nine million, seven hundred eighty-nine thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •