Base | Representation |
---|---|
bin | 11101100110110011001… |
… | …001101111001010001101 |
3 | 21012111110120002222210022 |
4 | 131212303021233022031 |
5 | 231313201423031013 |
6 | 4154351543551525 |
7 | 266663300622551 |
oct | 35466311571215 |
9 | 7174416088708 |
10 | 2034525205133 |
11 | 714923490473 |
12 | 28a37a45b5a5 |
13 | 119b162b9635 |
14 | 70685cc5861 |
15 | 37dc9023008 |
hex | 1d9b326f28d |
2034525205133 has 2 divisors, whose sum is σ = 2034525205134. Its totient is φ = 2034525205132.
The previous prime is 2034525205067. The next prime is 2034525205171. The reversal of 2034525205133 is 3315025254302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1971390099844 + 63135105289 = 1404062^2 + 251267^2 .
It is a cyclic number.
It is not a de Polignac number, because 2034525205133 - 220 = 2034524156557 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2034525205093 and 2034525205102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2034525295133) 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 as a sum of consecutive naturals, namely, 1017262602566 + 1017262602567.
It is an arithmetic number, because the mean of its divisors is an integer number (1017262602567).
Almost surely, 22034525205133 is an apocalyptic number.
It is an amenable number.
2034525205133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2034525205133 is an equidigital number, since it uses as much as digits as its factorization.
2034525205133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108000, while the sum is 35.
The spelling of 2034525205133 in words is "two trillion, thirty-four billion, five hundred twenty-five million, two hundred five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •