Base | Representation |
---|---|
bin | 111010100011011111110101… |
… | …1111011100010010110111101 |
3 | 2111112122111121022012201001100 |
4 | 1311012333223323202112331 |
5 | 1020002103241201001023 |
6 | 5023231404243003313 |
7 | 213326201131134066 |
oct | 16506775373422675 |
9 | 2445574538181040 |
10 | 515052141422013 |
11 | 13a1254284a6458 |
12 | 49924680069539 |
13 | 191512931b4bb0 |
14 | 9128929c1156d |
15 | 3e82a4c902c43 |
hex | 1d46febee25bd |
515052141422013 has 96 divisors (see below), whose sum is σ = 818358602181120. Its totient is φ = 310256390344320.
The previous prime is 515052141421981. The next prime is 515052141422059. The reversal of 515052141422013 is 310224141250515.
515052141422013 is a `hidden beast` number, since 5 + 1 + 5 + 0 + 5 + 2 + 1 + 414 + 220 + 13 = 666.
It is not a de Polignac number, because 515052141422013 - 25 = 515052141421981 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (515052141429013) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 366468370 + ... + 367871132.
It is an arithmetic number, because the mean of its divisors is an integer number (8524568772720).
Almost surely, 2515052141422013 is an apocalyptic number.
It is an amenable number.
515052141422013 is a deficient number, since it is larger than the sum of its proper divisors (303306460759107).
515052141422013 is a wasteful number, since it uses less digits than its factorization.
515052141422013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1403239 (or 1403236 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 36.
Adding to 515052141422013 its reverse (310224141250515), we get a palindrome (825276282672528).
The spelling of 515052141422013 in words is "five hundred fifteen trillion, fifty-two billion, one hundred forty-one million, four hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •