Base | Representation |
---|---|
bin | 101101011110010110111… |
… | …1010010111011111100101 |
3 | 211010111012121012211112102 |
4 | 1122330231322113133211 |
5 | 1304344343102102411 |
6 | 21143104125301445 |
7 | 1213354346555411 |
oct | 132745572273745 |
9 | 24114177184472 |
10 | 6249947690981 |
11 | 1a9a651599105 |
12 | 84b346a04885 |
13 | 3644a16355b7 |
14 | 1786db6a5d41 |
15 | ac8973bcd3b |
hex | 5af2de977e5 |
6249947690981 has 2 divisors, whose sum is σ = 6249947690982. Its totient is φ = 6249947690980.
The previous prime is 6249947690963. The next prime is 6249947691007. The reversal of 6249947690981 is 1890967499426.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3357451552225 + 2892496138756 = 1832335^2 + 1700734^2 .
It is a cyclic number.
It is not a de Polignac number, because 6249947690981 - 210 = 6249947689957 is a prime.
It is a super-2 number, since 2×62499476909812 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6249947690899 and 6249947690908.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6249947693981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3124973845490 + 3124973845491.
It is an arithmetic number, because the mean of its divisors is an integer number (3124973845491).
Almost surely, 26249947690981 is an apocalyptic number.
It is an amenable number.
6249947690981 is a deficient number, since it is larger than the sum of its proper divisors (1).
6249947690981 is an equidigital number, since it uses as much as digits as its factorization.
6249947690981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 423263232, while the sum is 74.
The spelling of 6249947690981 in words is "six trillion, two hundred forty-nine billion, nine hundred forty-seven million, six hundred ninety thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •