Base | Representation |
---|---|
bin | 1001011011100111… |
… | …11001000111110011 |
3 | 111001212221202100222 |
4 | 10231303321013303 |
5 | 40332231422311 |
6 | 2154241203255 |
7 | 236323265555 |
oct | 45563710763 |
9 | 14055852328 |
10 | 5063545331 |
11 | 216926a609 |
12 | b9393052b |
13 | 62907a490 |
14 | 3606c34d5 |
15 | 1e9809adb |
hex | 12dcf91f3 |
5063545331 has 8 divisors (see below), whose sum is σ = 5470815504. Its totient is φ = 4658813280.
The previous prime is 5063545321. The next prime is 5063545339. The reversal of 5063545331 is 1335453605.
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 5063545331 - 230 = 3989803507 is a prime.
It is a super-2 number, since 2×50635453312 = 51278982638183799122, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5063545291 and 5063545300.
It is not an unprimeable number, because it can be changed into a prime (5063545339) 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, 630380 + ... + 638361.
It is an arithmetic number, because the mean of its divisors is an integer number (683851938).
Almost surely, 25063545331 is an apocalyptic number.
5063545331 is a deficient number, since it is larger than the sum of its proper divisors (407270173).
5063545331 is a wasteful number, since it uses less digits than its factorization.
5063545331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1269061.
The product of its (nonzero) digits is 81000, while the sum is 35.
The square root of 5063545331 is about 71158.5928121123. The cubic root of 5063545331 is about 1717.1895389345.
Adding to 5063545331 its reverse (1335453605), we get a palindrome (6398998936).
The spelling of 5063545331 in words is "five billion, sixty-three million, five hundred forty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •