Base | Representation |
---|---|
bin | 100110001001100001100… |
… | …0101001000110101001010 |
3 | 200120020102221202111111010 |
4 | 1030103003011020311022 |
5 | 1141400414022131010 |
6 | 15052355000344350 |
7 | 1050542503130526 |
oct | 114230305106512 |
9 | 20506387674433 |
10 | 5243133005130 |
11 | 1741666990939 |
12 | 7081a27750b6 |
13 | 2c056b578787 |
14 | 141aaa180d86 |
15 | 915bc745620 |
hex | 4c4c3148d4a |
5243133005130 has 16 divisors (see below), whose sum is σ = 12583519212384. Its totient is φ = 1398168801360.
The previous prime is 5243133005119. The next prime is 5243133005221. The reversal of 5243133005130 is 315003313425.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 174771100171 = 5243133005130 / (5 + 2 + 4 + 3 + 1 + 3 + 3 + 0 + 0 + 5 + 1 + 3 + 0).
It is an unprimeable number.
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, 87385550056 + ... + 87385550115.
It is an arithmetic number, because the mean of its divisors is an integer number (786469950774).
Almost surely, 25243133005130 is an apocalyptic number.
5243133005130 is an abundant number, since it is smaller than the sum of its proper divisors (7340386207254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5243133005130 is a wasteful number, since it uses less digits than its factorization.
5243133005130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174771100181.
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 5243133005130 its reverse (315003313425), we get a palindrome (5558136318555).
The spelling of 5243133005130 in words is "five trillion, two hundred forty-three billion, one hundred thirty-three million, five thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •