Base | Representation |
---|---|
bin | 1010000000110110… |
… | …11100010101001101 |
3 | 111212122201011121111 |
4 | 11000123130111031 |
5 | 42002212344203 |
6 | 2245240132021 |
7 | 250135264513 |
oct | 50033342515 |
9 | 14778634544 |
10 | 5375903053 |
11 | 2309614594 |
12 | 1060467011 |
13 | 6789b4031 |
14 | 38dd924b3 |
15 | 216e5a26d |
hex | 1406dc54d |
5375903053 has 4 divisors (see below), whose sum is σ = 5456140480. Its totient is φ = 5295665628.
The previous prime is 5375903051. The next prime is 5375903077. The reversal of 5375903053 is 3503095735.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5375903053 - 21 = 5375903051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5375902997 and 5375903015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5375903051) 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, 40118613 + ... + 40118746.
It is an arithmetic number, because the mean of its divisors is an integer number (1364035120).
Almost surely, 25375903053 is an apocalyptic number.
It is an amenable number.
5375903053 is a deficient number, since it is larger than the sum of its proper divisors (80237427).
5375903053 is an equidigital number, since it uses as much as digits as its factorization.
5375903053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80237426.
The product of its (nonzero) digits is 212625, while the sum is 40.
The square root of 5375903053 is about 73320.5500047565. The cubic root of 5375903053 is about 1751.7971256031.
Adding to 5375903053 its reverse (3503095735), we get a palindrome (8878998788).
The spelling of 5375903053 in words is "five billion, three hundred seventy-five million, nine hundred three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •