Base | Representation |
---|---|
bin | 100100110000101000110… |
… | …1100000000010111110101 |
3 | 122212222202010112022001100 |
4 | 1021201101230000113311 |
5 | 1130234003004433303 |
6 | 14424550022520313 |
7 | 1031004341456265 |
oct | 111412154002765 |
9 | 18788663468040 |
10 | 5052252030453 |
11 | 1678714617401 |
12 | 6971b0b96099 |
13 | 2a856b581c94 |
14 | 13675d2197a5 |
15 | 8b649b5e8a3 |
hex | 49851b005f5 |
5052252030453 has 48 divisors (see below), whose sum is σ = 8089727929920. Its totient is φ = 3023852278272.
The previous prime is 5052252030391. The next prime is 5052252030493. The reversal of 5052252030453 is 3540302522505.
5052252030453 is a `hidden beast` number, since 5 + 0 + 52 + 2 + 520 + 30 + 4 + 53 = 666.
It is not a de Polignac number, because 5052252030453 - 26 = 5052252030389 is a prime.
It is a super-2 number, since 2×50522520304532 (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 (5052252030493) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6491151 + ... + 7227692.
It is an arithmetic number, because the mean of its divisors is an integer number (168535998540).
Almost surely, 25052252030453 is an apocalyptic number.
It is an amenable number.
5052252030453 is a deficient number, since it is larger than the sum of its proper divisors (3037475899467).
5052252030453 is a wasteful number, since it uses less digits than its factorization.
5052252030453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13718978 (or 13718975 counting only the distinct ones).
The product of its (nonzero) digits is 180000, while the sum is 36.
Adding to 5052252030453 its reverse (3540302522505), we get a palindrome (8592554552958).
The spelling of 5052252030453 in words is "five trillion, fifty-two billion, two hundred fifty-two million, thirty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •