Base | Representation |
---|---|
bin | 100000110111101010010100… |
… | …1000010011011101101000011 |
3 | 1101220201002011111112211210221 |
4 | 1001233110221002123231003 |
5 | 300344011001000442301 |
6 | 2502530105310403511 |
7 | 114620410035422305 |
oct | 10157245102335503 |
9 | 1356632144484727 |
10 | 289125001968451 |
11 | 84140252157660 |
12 | 28516442200597 |
13 | c5434a856598c |
14 | 5157a20a5b975 |
15 | 2365c1134eda1 |
hex | 106f52909bb43 |
289125001968451 has 24 divisors (see below), whose sum is σ = 319661258112000. Its totient is φ = 259339835069280.
The previous prime is 289125001968427. The next prime is 289125001968457. The reversal of 289125001968451 is 154869100521982.
It is not a de Polignac number, because 289125001968451 - 213 = 289125001960259 is a prime.
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 289125001968451.
It is not an unprimeable number, because it can be changed into a prime (289125001968457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26606950 + ... + 35863348.
It is an arithmetic number, because the mean of its divisors is an integer number (13319219088000).
Almost surely, 2289125001968451 is an apocalyptic number.
289125001968451 is a deficient number, since it is larger than the sum of its proper divisors (30536256143549).
289125001968451 is a wasteful number, since it uses less digits than its factorization.
289125001968451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9256867 (or 9256758 counting only the distinct ones).
The product of its (nonzero) digits is 12441600, while the sum is 61.
The spelling of 289125001968451 in words is "two hundred eighty-nine trillion, one hundred twenty-five billion, one million, nine hundred sixty-eight thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •