Base | Representation |
---|---|
bin | 1110101101100100011… |
… | …0101001001011001001 |
3 | 220011101121122202120010 |
4 | 3223121012221023021 |
5 | 13120113112004203 |
6 | 312040104222133 |
7 | 24155251543545 |
oct | 3533106511311 |
9 | 804347582503 |
10 | 252750500553 |
11 | 98211083001 |
12 | 40b9976a949 |
13 | 1aaacb77805 |
14 | c339c2ca25 |
15 | 6894527303 |
hex | 3ad91a92c9 |
252750500553 has 4 divisors (see below), whose sum is σ = 337000667408. Its totient is φ = 168500333700.
The previous prime is 252750500549. The next prime is 252750500573. The reversal of 252750500553 is 355005057252.
252750500553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 not a de Polignac number, because 252750500553 - 22 = 252750500549 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (252750500573) 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 3 ways as a sum of consecutive naturals, for example, 42125083423 + ... + 42125083428.
It is an arithmetic number, because the mean of its divisors is an integer number (84250166852).
Almost surely, 2252750500553 is an apocalyptic number.
It is an amenable number.
252750500553 is a deficient number, since it is larger than the sum of its proper divisors (84250166855).
252750500553 is an equidigital number, since it uses as much as digits as its factorization.
252750500553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84250166854.
The product of its (nonzero) digits is 262500, while the sum is 39.
The spelling of 252750500553 in words is "two hundred fifty-two billion, seven hundred fifty million, five hundred thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •