Base | Representation |
---|---|
bin | 100110001110101110101… |
… | …1011101011101110101101 |
3 | 200121022022002000202202221 |
4 | 1030131131123223232231 |
5 | 1142041313002303401 |
6 | 15101444200515341 |
7 | 1051416522460051 |
oct | 114353533535655 |
9 | 20538262022687 |
10 | 5254312541101 |
11 | 17463834a4768 |
12 | 70a3a277bb51 |
13 | 2c1630743a10 |
14 | 14244ac27c61 |
15 | 91a23e4a7a1 |
hex | 4c75d6ebbad |
5254312541101 has 8 divisors (see below), whose sum is σ = 5658739177784. Its totient is φ = 4849921440000.
The previous prime is 5254312541089. The next prime is 5254312541111. The reversal of 5254312541101 is 1011452134525.
It can be written as a sum of positive squares in 4 ways, for example, as 1389651957225 + 3864660583876 = 1178835^2 + 1965874^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5254312541101 - 27 = 5254312540973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5254312541111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8576400 + ... + 9168601.
It is an arithmetic number, because the mean of its divisors is an integer number (707342397223).
Almost surely, 25254312541101 is an apocalyptic number.
It is an amenable number.
5254312541101 is a deficient number, since it is larger than the sum of its proper divisors (404426636683).
5254312541101 is a wasteful number, since it uses less digits than its factorization.
5254312541101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17767791.
The product of its (nonzero) digits is 24000, while the sum is 34.
Adding to 5254312541101 its reverse (1011452134525), we get a palindrome (6265764675626).
The spelling of 5254312541101 in words is "five trillion, two hundred fifty-four billion, three hundred twelve million, five hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •