Base | Representation |
---|---|
bin | 1001100000110001… |
… | …0000100000111001 |
3 | 20120221120121222222 |
4 | 2120030100200321 |
5 | 20212124201301 |
6 | 1101211053425 |
7 | 120163055453 |
oct | 23014204071 |
9 | 6527517888 |
10 | 2553350201 |
11 | 10a0332886 |
12 | 5b3141275 |
13 | 318cbb70c |
14 | 1a317b2d3 |
15 | ee26831b |
hex | 98310839 |
2553350201 has 4 divisors (see below), whose sum is σ = 2553711504. Its totient is φ = 2552988900.
The previous prime is 2553350183. The next prime is 2553350203. The reversal of 2553350201 is 1020533552.
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 2553350201 - 226 = 2486241337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2553350203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 169835 + ... + 184256.
It is an arithmetic number, because the mean of its divisors is an integer number (638427876).
Almost surely, 22553350201 is an apocalyptic number.
It is an amenable number.
2553350201 is a deficient number, since it is larger than the sum of its proper divisors (361303).
2553350201 is an equidigital number, since it uses as much as digits as its factorization.
2553350201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361302.
The product of its (nonzero) digits is 4500, while the sum is 26.
The square root of 2553350201 is about 50530.6857364909. The cubic root of 2553350201 is about 1366.7952514814.
Adding to 2553350201 its reverse (1020533552), we get a palindrome (3573883753).
The spelling of 2553350201 in words is "two billion, five hundred fifty-three million, three hundred fifty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •