Base | Representation |
---|---|
bin | 100110110100000101001… |
… | …1101111100100101111001 |
3 | 200212222100012221002021211 |
4 | 1031220022131330211321 |
5 | 1144400101400113103 |
6 | 15202351424203121 |
7 | 1060256334244342 |
oct | 115501235744571 |
9 | 20788305832254 |
10 | 5334525004153 |
11 | 17773a5326444 |
12 | 721a497694a1 |
13 | 2c90748a77c7 |
14 | 146299cab0c9 |
15 | 93b6add636d |
hex | 4da0a77c979 |
5334525004153 has 4 divisors (see below), whose sum is σ = 5334661194148. Its totient is φ = 5334388814160.
The previous prime is 5334525004147. The next prime is 5334525004201. The reversal of 5334525004153 is 3514005254335.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4967050201344 + 367474802809 = 2228688^2 + 606197^2 .
It is a cyclic number.
It is not a de Polignac number, because 5334525004153 - 25 = 5334525004121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5334525004453) 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, 68036226 + ... + 68114587.
It is an arithmetic number, because the mean of its divisors is an integer number (1333665298537).
Almost surely, 25334525004153 is an apocalyptic number.
It is an amenable number.
5334525004153 is a deficient number, since it is larger than the sum of its proper divisors (136189995).
5334525004153 is a wasteful number, since it uses less digits than its factorization.
5334525004153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136189994.
The product of its (nonzero) digits is 540000, while the sum is 40.
The spelling of 5334525004153 in words is "five trillion, three hundred thirty-four billion, five hundred twenty-five million, four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •