Base | Representation |
---|---|
bin | 100110110010000101111… |
… | …0110000001001000111001 |
3 | 200212120022111122002121001 |
4 | 1031210023312001020321 |
5 | 1144312324244433103 |
6 | 15200403503045001 |
7 | 1060045432666606 |
oct | 115441366011071 |
9 | 20776274562531 |
10 | 5330253124153 |
11 | 1775602a24801 |
12 | 721056ba0761 |
13 | 2c8843852669 |
14 | 145db27c36ad |
15 | 939bad5901d |
hex | 4d90bd81239 |
5330253124153 has 8 divisors (see below), whose sum is σ = 5352628112640. Its totient is φ = 5307878741760.
The previous prime is 5330253124111. The next prime is 5330253124171. The reversal of 5330253124153 is 3514213520335.
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 5330253124153 - 29 = 5330253123641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5330253124453) 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, 30142233 + ... + 30318553.
It is an arithmetic number, because the mean of its divisors is an integer number (669078514080).
Almost surely, 25330253124153 is an apocalyptic number.
It is an amenable number.
5330253124153 is a deficient number, since it is larger than the sum of its proper divisors (22374988487).
5330253124153 is a wasteful number, since it uses less digits than its factorization.
5330253124153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303047.
The product of its (nonzero) digits is 162000, while the sum is 37.
Adding to 5330253124153 its reverse (3514213520335), we get a palindrome (8844466644488).
The spelling of 5330253124153 in words is "five trillion, three hundred thirty billion, two hundred fifty-three million, one hundred twenty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •