Base | Representation |
---|---|
bin | 100110101110000001010… |
… | …1110000111101001100101 |
3 | 200211201202012010200021111 |
4 | 1031130002232013221211 |
5 | 1144141423042433013 |
6 | 15152400142145021 |
7 | 1056315660503620 |
oct | 115340256075145 |
9 | 20751665120244 |
10 | 5321510124133 |
11 | 1771926808455 |
12 | 71b416b82171 |
13 | 2c7a7c3c5c78 |
14 | 1457c358adb7 |
15 | 936584e573d |
hex | 4d702b87a65 |
5321510124133 has 8 divisors (see below), whose sum is σ = 6081956898752. Its totient is φ = 4561121110176.
The previous prime is 5321510124121. The next prime is 5321510124197. The reversal of 5321510124133 is 3314210151235.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5321510124133 - 213 = 5321510115941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5321510124095 and 5321510124104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5321510164133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14242560 + ... + 14611417.
It is an arithmetic number, because the mean of its divisors is an integer number (760244612344).
Almost surely, 25321510124133 is an apocalyptic number.
It is an amenable number.
5321510124133 is a deficient number, since it is larger than the sum of its proper divisors (760446774619).
5321510124133 is a wasteful number, since it uses less digits than its factorization.
5321510124133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28880331.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 5321510124133 its reverse (3314210151235), we get a palindrome (8635720275368).
The spelling of 5321510124133 in words is "five trillion, three hundred twenty-one billion, five hundred ten million, one hundred twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •