Base | Representation |
---|---|
bin | 100100101100000100101… |
… | …1100101010100111101100 |
3 | 122212001110000111101220121 |
4 | 1021120021130222213230 |
5 | 1130103414212140202 |
6 | 14420245233454324 |
7 | 1030206420533410 |
oct | 111301134524754 |
9 | 18761400441817 |
10 | 5042450115052 |
11 | 16745446a7279 |
12 | 6953164113a4 |
13 | 2a766892b03c |
14 | 1360ad4dad40 |
15 | 8b27437d537 |
hex | 4960972a9ec |
5042450115052 has 96 divisors (see below), whose sum is σ = 10828395454464. Its totient is φ = 2007628761600.
The previous prime is 5042450115037. The next prime is 5042450115071. The reversal of 5042450115052 is 2505110542405.
It is a junction number, because it is equal to n+sod(n) for n = 5042450114999 and 5042450115017.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5459902 + ... + 6316282.
It is an arithmetic number, because the mean of its divisors is an integer number (112795785984).
Almost surely, 25042450115052 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5042450115052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5414197727232).
5042450115052 is an abundant number, since it is smaller than the sum of its proper divisors (5785945339412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5042450115052 is a wasteful number, since it uses less digits than its factorization.
5042450115052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 856679 (or 856677 counting only the distinct ones).
The product of its (nonzero) digits is 40000, while the sum is 34.
Adding to 5042450115052 its reverse (2505110542405), we get a palindrome (7547560657457).
The spelling of 5042450115052 in words is "five trillion, forty-two billion, four hundred fifty million, one hundred fifteen thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •