Base | Representation |
---|---|
bin | 100110100101011001110… |
… | …0001000111001100010101 |
3 | 200202221222021210100212011 |
4 | 1031022303201013030111 |
5 | 1143341021332221031 |
6 | 15140055405024221 |
7 | 1055062214356441 |
oct | 115126341071425 |
9 | 20687867710764 |
10 | 5303001445141 |
11 | 1764a99080a34 |
12 | 717910555071 |
13 | 2c60bc9920ca |
14 | 144949389821 |
15 | 92e2365c6b1 |
hex | 4d2b3847315 |
5303001445141 has 4 divisors (see below), whose sum is σ = 5303198455884. Its totient is φ = 5302804434400.
The previous prime is 5303001445139. The next prime is 5303001445153. The reversal of 5303001445141 is 1415441003035.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4934395822500 + 368605622641 = 2221350^2 + 607129^2 .
It is a cyclic number.
It is not a de Polignac number, because 5303001445141 - 21 = 5303001445139 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 (5303001245141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 98464990 + ... + 98518831.
It is an arithmetic number, because the mean of its divisors is an integer number (1325799613971).
Almost surely, 25303001445141 is an apocalyptic number.
It is an amenable number.
5303001445141 is a deficient number, since it is larger than the sum of its proper divisors (197010743).
5303001445141 is a wasteful number, since it uses less digits than its factorization.
5303001445141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 197010742.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 5303001445141 its reverse (1415441003035), we get a palindrome (6718442448176).
The spelling of 5303001445141 in words is "five trillion, three hundred three billion, one million, four hundred forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •