Base | Representation |
---|---|
bin | 111101001100000… |
… | …1010010011110001 |
3 | 12022002101000211222 |
4 | 1322120022103301 |
5 | 13201101412113 |
6 | 535422114425 |
7 | 101610343550 |
oct | 17230122361 |
9 | 5262330758 |
10 | 2053154033 |
11 | 963a52017 |
12 | 49371ba15 |
13 | 269498258 |
14 | 156973d97 |
15 | c03b1e08 |
hex | 7a60a4f1 |
2053154033 has 4 divisors (see below), whose sum is σ = 2346461760. Its totient is φ = 1759846308.
The previous prime is 2053154023. The next prime is 2053154053. The reversal of 2053154033 is 3304513502.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2053154033 - 24 = 2053154017 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2053153993 and 2053154011.
It is not an unprimeable number, because it can be changed into a prime (2053154023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 146653853 + ... + 146653866.
It is an arithmetic number, because the mean of its divisors is an integer number (586615440).
Almost surely, 22053154033 is an apocalyptic number.
It is an amenable number.
2053154033 is a deficient number, since it is larger than the sum of its proper divisors (293307727).
2053154033 is an equidigital number, since it uses as much as digits as its factorization.
2053154033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293307726.
The product of its (nonzero) digits is 5400, while the sum is 26.
The square root of 2053154033 is about 45311.7427716039. The cubic root of 2053154033 is about 1270.9852509151.
Adding to 2053154033 its reverse (3304513502), we get a palindrome (5357667535).
The spelling of 2053154033 in words is "two billion, fifty-three million, one hundred fifty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •