Base | Representation |
---|---|
bin | 100110001110110010001… |
… | …1100010101001010011000 |
3 | 200121022121021022222122222 |
4 | 1030131210130111022120 |
5 | 1142042033104320240 |
6 | 15101504001403212 |
7 | 1051422451236020 |
oct | 114354434251230 |
9 | 20538537288588 |
10 | 5254430151320 |
11 | 1746433923a99 |
12 | 70a416039508 |
13 | 2c164bc11c6c |
14 | 14245c6c0a80 |
15 | 91a2e42ceb5 |
hex | 4c764715298 |
5254430151320 has 128 divisors (see below), whose sum is σ = 14099912524800. Its totient is φ = 1723061362176.
The previous prime is 5254430151281. The next prime is 5254430151323. The reversal of 5254430151320 is 231510344525.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5254430151323) 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 31 ways as a sum of consecutive naturals, for example, 122782967 + ... + 122825753.
It is an arithmetic number, because the mean of its divisors is an integer number (110155566600).
Almost surely, 25254430151320 is an apocalyptic number.
It is an amenable number.
5254430151320 is an abundant number, since it is smaller than the sum of its proper divisors (8845482373480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5254430151320 is a wasteful number, since it uses less digits than its factorization.
5254430151320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61897 (or 61893 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 5254430151320 its reverse (231510344525), we get a palindrome (5485940495845).
The spelling of 5254430151320 in words is "five trillion, two hundred fifty-four billion, four hundred thirty million, one hundred fifty-one thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •