Base | Representation |
---|---|
bin | 100110001110001001001… |
… | …1110110000011010001111 |
3 | 200121012001102211212211021 |
4 | 1030130102132300122033 |
5 | 1142031224043234003 |
6 | 15101115320335011 |
7 | 1051343413146223 |
oct | 114342236603217 |
9 | 20535042755737 |
10 | 5253055055503 |
11 | 17458986a5172 |
12 | 70a0b1614467 |
13 | 2c1490072bb8 |
14 | 14236bc12783 |
15 | 9199d8572bd |
hex | 4c7127b068f |
5253055055503 has 8 divisors (see below), whose sum is σ = 5562084184272. Its totient is φ = 4944028803456.
The previous prime is 5253055055477. The next prime is 5253055055513. The reversal of 5253055055503 is 3055505503525.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5253055055503 - 217 = 5253054924431 is a prime.
It is a super-2 number, since 2×52530550555032 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5253055055503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5253055055513) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3881176 + ... + 5056642.
It is an arithmetic number, because the mean of its divisors is an integer number (695260523034).
Almost surely, 25253055055503 is an apocalyptic number.
5253055055503 is a deficient number, since it is larger than the sum of its proper divisors (309029128769).
5253055055503 is a wasteful number, since it uses less digits than its factorization.
5253055055503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1438361.
The product of its (nonzero) digits is 1406250, while the sum is 43.
The spelling of 5253055055503 in words is "five trillion, two hundred fifty-three billion, fifty-five million, fifty-five thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •