Base | Representation |
---|---|
bin | 1001011010001010… |
… | …10011001100011001 |
3 | 111001000222012221102 |
4 | 10231011103030121 |
5 | 40321120100403 |
6 | 2153123321145 |
7 | 236114415365 |
oct | 45505231431 |
9 | 14030865842 |
10 | 5051331353 |
11 | 2162388012 |
12 | b8b8201b5 |
13 | 626691c83 |
14 | 35cc242a5 |
15 | 1e86e5b88 |
hex | 12d153319 |
5051331353 has 8 divisors (see below), whose sum is σ = 5204546880. Its totient is φ = 4898994480.
The previous prime is 5051331211. The next prime is 5051331359. The reversal of 5051331353 is 3531331505.
5051331353 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5051331353 - 28 = 5051331097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5051331359) 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, 207983 + ... + 230996.
It is an arithmetic number, because the mean of its divisors is an integer number (650568360).
Almost surely, 25051331353 is an apocalyptic number.
It is an amenable number.
5051331353 is a deficient number, since it is larger than the sum of its proper divisors (153215527).
5051331353 is a wasteful number, since it uses less digits than its factorization.
5051331353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439327.
The product of its (nonzero) digits is 10125, while the sum is 29.
The square root of 5051331353 is about 71072.7187674708. The cubic root of 5051331353 is about 1715.8077270250.
Adding to 5051331353 its reverse (3531331505), we get a palindrome (8582662858).
The spelling of 5051331353 in words is "five billion, fifty-one million, three hundred thirty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •