Base | Representation |
---|---|
bin | 100100011111011011101… |
… | …1011110000111000001101 |
3 | 122202110101011221022021200 |
4 | 1020332313123300320031 |
5 | 1124132320402434203 |
6 | 14355555441420113 |
7 | 1025225626350114 |
oct | 110766733607015 |
9 | 18673334838250 |
10 | 5015304343053 |
11 | 1663a84609a64 |
12 | 68bbbb33a639 |
13 | 2a4c3099bb64 |
14 | 134a56190c7b |
15 | 8a6d61019a3 |
hex | 48fb76f0e0d |
5015304343053 has 12 divisors (see below), whose sum is σ = 7244807213280. Its totient is φ = 3343315282056.
The previous prime is 5015304343031. The next prime is 5015304343057. The reversal of 5015304343053 is 3503434035105.
5015304343053 is a `hidden beast` number, since 5 + 0 + 1 + 5 + 304 + 343 + 0 + 5 + 3 = 666.
It is not a de Polignac number, because 5015304343053 - 26 = 5015304342989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5015304342999 and 5015304343017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5015304343057) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18268401 + ... + 18540902.
It is an arithmetic number, because the mean of its divisors is an integer number (603733934440).
Almost surely, 25015304343053 is an apocalyptic number.
It is an amenable number.
5015304343053 is a deficient number, since it is larger than the sum of its proper divisors (2229502870227).
5015304343053 is a wasteful number, since it uses less digits than its factorization.
5015304343053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36824448 (or 36824445 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 36.
Adding to 5015304343053 its reverse (3503434035105), we get a palindrome (8518738378158).
The spelling of 5015304343053 in words is "five trillion, fifteen billion, three hundred four million, three hundred forty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.287 sec. • engine limits •