Base | Representation |
---|---|
bin | 100110101111010000001… |
… | …0000110110011000000010 |
3 | 200211222120101122110011101 |
4 | 1031132200100312120002 |
5 | 1144212331213020310 |
6 | 15153514321405014 |
7 | 1056441323636044 |
oct | 115364020663002 |
9 | 20758511573141 |
10 | 5324153251330 |
11 | 1772a62789aa1 |
12 | 71ba3419976a |
13 | 2c80b0b88c64 |
14 | 145994617a94 |
15 | 9376059443a |
hex | 4d7a0436602 |
5324153251330 has 8 divisors (see below), whose sum is σ = 9583475852412. Its totient is φ = 2129661300528.
The previous prime is 5324153251297. The next prime is 5324153251331. The reversal of 5324153251330 is 331523514235.
It can be written as a sum of positive squares in 2 ways, for example, as 5144735776401 + 179417474929 = 2268201^2 + 423577^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 5324153251330.
It is not an unprimeable number, because it can be changed into a prime (5324153251331) 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 3 ways as a sum of consecutive naturals, for example, 266207662557 + ... + 266207662576.
Almost surely, 25324153251330 is an apocalyptic number.
5324153251330 is a deficient number, since it is larger than the sum of its proper divisors (4259322601082).
5324153251330 is a wasteful number, since it uses less digits than its factorization.
5324153251330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532415325140.
The product of its (nonzero) digits is 162000, while the sum is 37.
Adding to 5324153251330 its reverse (331523514235), we get a palindrome (5655676765565).
The spelling of 5324153251330 in words is "five trillion, three hundred twenty-four billion, one hundred fifty-three million, two hundred fifty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •