Base | Representation |
---|---|
bin | 100110001110001011000… |
… | …0000100100011100101111 |
3 | 200121012012120020022212010 |
4 | 1030130112000210130233 |
5 | 1142031334222013210 |
6 | 15101125233212303 |
7 | 1051345032253056 |
oct | 114342600443457 |
9 | 20535176208763 |
10 | 5253114251055 |
11 | 1745919056710 |
12 | 70a109401093 |
13 | 2c149c3ca958 |
14 | 142375a2139d |
15 | 919a3b4b920 |
hex | 4c71602472f |
5253114251055 has 64 divisors (see below), whose sum is σ = 9652398400512. Its totient is φ = 2414667171840.
The previous prime is 5253114251029. The next prime is 5253114251059. The reversal of 5253114251055 is 5501524113525.
It is not a de Polignac number, because 5253114251055 - 216 = 5253114185519 is a prime.
It is a super-2 number, since 2×52531142510552 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5253114251059) 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 63 ways as a sum of consecutive naturals, for example, 5696032 + ... + 6553701.
It is an arithmetic number, because the mean of its divisors is an integer number (150818725008).
Almost surely, 25253114251055 is an apocalyptic number.
5253114251055 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5253114251055 is a deficient number, since it is larger than the sum of its proper divisors (4399284149457).
5253114251055 is a wasteful number, since it uses less digits than its factorization.
5253114251055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12249888.
The product of its (nonzero) digits is 150000, while the sum is 39.
The spelling of 5253114251055 in words is "five trillion, two hundred fifty-three billion, one hundred fourteen million, two hundred fifty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •