Base | Representation |
---|---|
bin | 1100110111010011… |
… | …11110110101000001 |
3 | 122211022200120000001 |
4 | 12123221332311001 |
5 | 103121022103100 |
6 | 3101153000001 |
7 | 333101531401 |
oct | 63351766501 |
9 | 18738616001 |
10 | 6906441025 |
11 | 2a24562400 |
12 | 1408b53001 |
13 | 860b090c3 |
14 | 497364801 |
15 | 2a64d7d6a |
hex | 19ba7ed41 |
6906441025 has 27 divisors (see below), whose sum is σ = 9419541859. Its totient is φ = 5019542000.
The previous prime is 6906441019. The next prime is 6906441037. The reversal of 6906441025 is 5201446096.
The square root of 6906441025 is 83105.
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., 2486318769 + 4420122256 = 49863^2 + 66484^2 .
It is not a de Polignac number, because 6906441025 - 217 = 6906309953 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 4570020 + ... + 4571530.
Almost surely, 26906441025 is an apocalyptic number.
6906441025 is the 83105-th square number.
6906441025 is the 41553-rd centered octagonal number.
It is an amenable number.
6906441025 is a deficient number, since it is larger than the sum of its proper divisors (2513100834).
6906441025 is an equidigital number, since it uses as much as digits as its factorization.
6906441025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3054 (or 1527 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 37.
The cubic root of 6906441025 is about 1904.3704585728.
It can be divided in two parts, 6906 and 441025, that added together give a triangular number (447931 = T946).
The spelling of 6906441025 in words is "six billion, nine hundred six million, four hundred forty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •