Base | Representation |
---|---|
bin | 110001011110100001… |
… | …000011110010100101 |
3 | 12002010101200111022211 |
4 | 301132201003302211 |
5 | 1332300041112013 |
6 | 40223324123421 |
7 | 3560331605146 |
oct | 613641036245 |
9 | 162111614284 |
10 | 53125332133 |
11 | 20591957375 |
12 | a367696571 |
13 | 50183c7193 |
14 | 27dd83dacd |
15 | 15ade4423d |
hex | c5e843ca5 |
53125332133 has 8 divisors (see below), whose sum is σ = 53264710656. Its totient is φ = 52986133200.
The previous prime is 53125332131. The next prime is 53125332151. The reversal of 53125332133 is 33123352135.
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 53125332133 - 21 = 53125332131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53125332095 and 53125332104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53125332131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 558060 + ... + 646282.
It is an arithmetic number, because the mean of its divisors is an integer number (6658088832).
Almost surely, 253125332133 is an apocalyptic number.
It is an amenable number.
53125332133 is a deficient number, since it is larger than the sum of its proper divisors (139378523).
53125332133 is an equidigital number, since it uses as much as digits as its factorization.
53125332133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89795.
The product of its digits is 24300, while the sum is 31.
Adding to 53125332133 its reverse (33123352135), we get a palindrome (86248684268).
The spelling of 53125332133 in words is "fifty-three billion, one hundred twenty-five million, three hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •