Base | Representation |
---|---|
bin | 11101010100000101100… |
… | …100011110100011010001 |
3 | 21010120121022021211002001 |
4 | 131110011210132203101 |
5 | 231001024334011400 |
6 | 4141230124354001 |
7 | 265352346626434 |
oct | 35240544364321 |
9 | 7116538254061 |
10 | 2014433110225 |
11 | 707352a7a158 |
12 | 2864b16a5901 |
13 | 117c63808393 |
14 | 6d6db6a981b |
15 | 37600164a6a |
hex | 1d50591e8d1 |
2014433110225 has 12 divisors (see below), whose sum is σ = 2629365323440. Its totient is φ = 1526728251600.
The previous prime is 2014433110127. The next prime is 2014433110229. The reversal of 2014433110225 is 5220113344102.
It is a de Polignac number, because none of the positive numbers 2k-2014433110225 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2014433110193 and 2014433110202.
It is not an unprimeable number, because it can be changed into a prime (2014433110229) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 2120455431 + ... + 2120456380.
Almost surely, 22014433110225 is an apocalyptic number.
2014433110225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2014433110225 is a deficient number, since it is larger than the sum of its proper divisors (614932213215).
2014433110225 is a wasteful number, since it uses less digits than its factorization.
2014433110225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4240911840 (or 4240911835 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 2014433110225 its reverse (5220113344102), we get a palindrome (7234546454327).
The spelling of 2014433110225 in words is "two trillion, fourteen billion, four hundred thirty-three million, one hundred ten thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •