Base | Representation |
---|---|
bin | 100101111011011111111… |
… | …0000101010011011110111 |
3 | 200110100200210210002012111 |
4 | 1023312333300222123313 |
5 | 1140402222202110111 |
6 | 15030454102231451 |
7 | 1045425211302100 |
oct | 113667760523367 |
9 | 20410623702174 |
10 | 5213012535031 |
11 | 172a90a744944 |
12 | 702397425587 |
13 | 2ba77b2537c2 |
14 | 14044db373a7 |
15 | 90908271a21 |
hex | 4bdbfc2a6f7 |
5213012535031 has 24 divisors (see below), whose sum is σ = 6175257937920. Its totient is φ = 4386929526000.
The previous prime is 5213012535023. The next prime is 5213012535119. The reversal of 5213012535031 is 1305352103125.
It is not a de Polignac number, because 5213012535031 - 23 = 5213012535023 is a prime.
It is a super-2 number, since 2×52130125350312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5213012534984 and 5213012535002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5213012535001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2303295 + ... + 3966256.
It is an arithmetic number, because the mean of its divisors is an integer number (257302414080).
Almost surely, 25213012535031 is an apocalyptic number.
5213012535031 is a deficient number, since it is larger than the sum of its proper divisors (962245402889).
5213012535031 is a wasteful number, since it uses less digits than its factorization.
5213012535031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6269875 (or 6269868 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 31.
Adding to 5213012535031 its reverse (1305352103125), we get a palindrome (6518364638156).
The spelling of 5213012535031 in words is "five trillion, two hundred thirteen billion, twelve million, five hundred thirty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •