Base | Representation |
---|---|
bin | 101000000001011011011… |
… | …1111001010101111010101 |
3 | 201110212002020022020011221 |
4 | 1100002312333022233111 |
5 | 1210110241301320003 |
6 | 15410541555130341 |
7 | 1105256456556334 |
oct | 120026677125725 |
9 | 21425066266157 |
10 | 5500628151253 |
11 | 1830892210324 |
12 | 74a0852a39b1 |
13 | 30b9263b6271 |
14 | 15033619dd1b |
15 | 9813d5837bd |
hex | 500b6fcabd5 |
5500628151253 has 4 divisors (see below), whose sum is σ = 5520065000128. Its totient is φ = 5481191302380.
The previous prime is 5500628151247. The next prime is 5500628151283. The reversal of 5500628151253 is 3521518260055.
It is a happy number.
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 a de Polignac number, because none of the positive numbers 2k-5500628151253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5500628151203) 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 in 3 ways as a sum of consecutive naturals, for example, 9718424013 + ... + 9718424578.
It is an arithmetic number, because the mean of its divisors is an integer number (1380016250032).
Almost surely, 25500628151253 is an apocalyptic number.
It is an amenable number.
5500628151253 is a deficient number, since it is larger than the sum of its proper divisors (19436848875).
5500628151253 is a wasteful number, since it uses less digits than its factorization.
5500628151253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19436848874.
The product of its (nonzero) digits is 360000, while the sum is 43.
The spelling of 5500628151253 in words is "five trillion, five hundred billion, six hundred twenty-eight million, one hundred fifty-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •