Base | Representation |
---|---|
bin | 100101010110100010111… |
… | …1000010110001000001001 |
3 | 200011202212110211010222010 |
4 | 1022231011320112020021 |
5 | 1133102213012123241 |
6 | 14530211534050133 |
7 | 1036615560466512 |
oct | 112550570261011 |
9 | 20152773733863 |
10 | 5133658317321 |
11 | 16aa199316636 |
12 | 6aab2b949949 |
13 | 2b3142b56cb1 |
14 | 13a682a61a09 |
15 | 8d811815d16 |
hex | 4ab45e16209 |
5133658317321 has 8 divisors (see below), whose sum is σ = 6851117394144. Its totient is φ = 3419319059360.
The previous prime is 5133658317317. The next prime is 5133658317343. The reversal of 5133658317321 is 1237138563315.
5133658317321 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 5133658317321 - 22 = 5133658317317 is a prime.
It is a super-2 number, since 2×51336583173212 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5133658317301) 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, 779950875 + ... + 779957456.
It is an arithmetic number, because the mean of its divisors is an integer number (856389674268).
Almost surely, 25133658317321 is an apocalyptic number.
It is an amenable number.
5133658317321 is a deficient number, since it is larger than the sum of its proper divisors (1717459076823).
5133658317321 is a wasteful number, since it uses less digits than its factorization.
5133658317321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1559909431.
The product of its digits is 1360800, while the sum is 48.
The spelling of 5133658317321 in words is "five trillion, one hundred thirty-three billion, six hundred fifty-eight million, three hundred seventeen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •