Base | Representation |
---|---|
bin | 1001010101110001… |
… | …11001011001011011 |
3 | 110221110201021211211 |
4 | 10222320321121123 |
5 | 40232204304111 |
6 | 2145330403551 |
7 | 235156522651 |
oct | 45270713133 |
9 | 13843637754 |
10 | 5014525531 |
11 | 2143629284 |
12 | b7b4305b7 |
13 | 61bb76292 |
14 | 357da2dd1 |
15 | 1e5375521 |
hex | 12ae3965b |
5014525531 has 8 divisors (see below), whose sum is σ = 5073260544. Its totient is φ = 4956091560.
The previous prime is 5014525493. The next prime is 5014525589. The reversal of 5014525531 is 1355254105.
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 5014525531 - 217 = 5014394459 is a prime.
It is a super-2 number, since 2×50145255312 = 50290932602101663922, 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 = 5014525493 and 5014525502.
It is not an unprimeable number, because it can be changed into a prime (5014525331) 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, 41665 + ... + 108466.
It is an arithmetic number, because the mean of its divisors is an integer number (634157568).
Almost surely, 25014525531 is an apocalyptic number.
5014525531 is a deficient number, since it is larger than the sum of its proper divisors (58735013).
5014525531 is a wasteful number, since it uses less digits than its factorization.
5014525531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150521.
The product of its (nonzero) digits is 15000, while the sum is 31.
The square root of 5014525531 is about 70813.3146449169. The cubic root of 5014525531 is about 1711.6302329918.
Adding to 5014525531 its reverse (1355254105), we get a palindrome (6369779636).
The spelling of 5014525531 in words is "five billion, fourteen million, five hundred twenty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •