Base | Representation |
---|---|
bin | 100110111000111110111… |
… | …0111100001111011101101 |
3 | 200220222111210111100112201 |
4 | 1031301331313201323231 |
5 | 1200033131030301013 |
6 | 15211252121301501 |
7 | 1061111230040221 |
oct | 115617567417355 |
9 | 20828453440481 |
10 | 5345051025133 |
11 | 1780906a5a836 |
12 | 723aa6934891 |
13 | 2ca06155aba1 |
14 | 1469b7c3a781 |
15 | 9408504c3dd |
hex | 4dc7dde1eed |
5345051025133 has 8 divisors (see below), whose sum is σ = 5626397481120. Its totient is φ = 5063707367280.
The previous prime is 5345051025047. The next prime is 5345051025143. The reversal of 5345051025133 is 3315201505435.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5345051025133 is a prime.
It is a super-2 number, since 2×53450510251332 (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 = 5345051025092 and 5345051025101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5345051025143) 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, 4047498 + ... + 5203108.
It is an arithmetic number, because the mean of its divisors is an integer number (703299685140).
Almost surely, 25345051025133 is an apocalyptic number.
It is an amenable number.
5345051025133 is a deficient number, since it is larger than the sum of its proper divisors (281346455987).
5345051025133 is a wasteful number, since it uses less digits than its factorization.
5345051025133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1399067.
The product of its (nonzero) digits is 135000, while the sum is 37.
The spelling of 5345051025133 in words is "five trillion, three hundred forty-five billion, fifty-one million, twenty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •