Base | Representation |
---|---|
bin | 100110110011001100110… |
… | …0100001000101110100001 |
3 | 200212210110012122121111002 |
4 | 1031212121210020232201 |
5 | 1144332211441120223 |
6 | 15201435441001345 |
7 | 1060161363631154 |
oct | 115463144105641 |
9 | 20783405577432 |
10 | 5332630801313 |
11 | 177661307a852 |
12 | 7215bb323255 |
13 | 2c8b3232381a |
14 | 14615a4b1c9b |
15 | 93aa9970e28 |
hex | 4d999908ba1 |
5332630801313 has 8 divisors (see below), whose sum is σ = 5355438714240. Its totient is φ = 5309827019280.
The previous prime is 5332630801297. The next prime is 5332630801319. The reversal of 5332630801313 is 3131080362335.
It is a happy number.
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 5332630801313 - 24 = 5332630801297 is a prime.
It is a super-2 number, since 2×53326308013132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5332630801319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1568606 + ... + 3622952.
It is an arithmetic number, because the mean of its divisors is an integer number (669429839280).
Almost surely, 25332630801313 is an apocalyptic number.
It is an amenable number.
5332630801313 is a deficient number, since it is larger than the sum of its proper divisors (22807912927).
5332630801313 is a wasteful number, since it uses less digits than its factorization.
5332630801313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2065447.
The product of its (nonzero) digits is 116640, while the sum is 38.
The spelling of 5332630801313 in words is "five trillion, three hundred thirty-two billion, six hundred thirty million, eight hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •