Base | Representation |
---|---|
bin | 1001111011111111… |
… | …11111110110000011 |
3 | 111202211000220111012 |
4 | 10331333333312003 |
5 | 41411244412201 |
6 | 2241222511135 |
7 | 246132026663 |
oct | 47577776603 |
9 | 14684026435 |
10 | 5335154051 |
11 | 2298612227 |
12 | 104a8954ab |
13 | 6704175b6 |
14 | 3887c61a3 |
15 | 2135ab5bb |
hex | 13dfffd83 |
5335154051 has 4 divisors (see below), whose sum is σ = 5335303512. Its totient is φ = 5335004592.
The previous prime is 5335154029. The next prime is 5335154057. The reversal of 5335154051 is 1504515335.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5335154051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5335153999 and 5335154017.
It is not an unprimeable number, because it can be changed into a prime (5335154057) 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, 13676 + ... + 104198.
It is an arithmetic number, because the mean of its divisors is an integer number (1333825878).
Almost surely, 25335154051 is an apocalyptic number.
5335154051 is a deficient number, since it is larger than the sum of its proper divisors (149461).
5335154051 is an equidigital number, since it uses as much as digits as its factorization.
5335154051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 149460.
The product of its (nonzero) digits is 22500, while the sum is 32.
The square root of 5335154051 is about 73042.1388720237. The cubic root of 5335154051 is about 1747.3597247756.
Adding to 5335154051 its reverse (1504515335), we get a palindrome (6839669386).
The spelling of 5335154051 in words is "five billion, three hundred thirty-five million, one hundred fifty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •