Base | Representation |
---|---|
bin | 1001011111001111… |
… | …01011001011111001 |
3 | 111011000001202222010 |
4 | 10233213223023321 |
5 | 40413014200303 |
6 | 2201243520133 |
7 | 240142260345 |
oct | 45747531371 |
9 | 14130052863 |
10 | 5093896953 |
11 | 21844101a2 |
12 | ba1b29049 |
13 | 632446512 |
14 | 364744625 |
15 | 1ec302c03 |
hex | 12f9eb2f9 |
5093896953 has 4 divisors (see below), whose sum is σ = 6791862608. Its totient is φ = 3395931300.
The previous prime is 5093896931. The next prime is 5093896961. The reversal of 5093896953 is 3596983905.
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 not a de Polignac number, because 5093896953 - 25 = 5093896921 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5093896893 and 5093896902.
It is not an unprimeable number, because it can be changed into a prime (5093897953) 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, 848982823 + ... + 848982828.
It is an arithmetic number, because the mean of its divisors is an integer number (1697965652).
Almost surely, 25093896953 is an apocalyptic number.
It is an amenable number.
5093896953 is a deficient number, since it is larger than the sum of its proper divisors (1697965655).
5093896953 is a wasteful number, since it uses less digits than its factorization.
5093896953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1697965654.
The product of its (nonzero) digits is 7873200, while the sum is 57.
The square root of 5093896953 is about 71371.5416184910. The cubic root of 5093896953 is about 1720.6137336800.
The spelling of 5093896953 in words is "five billion, ninety-three million, eight hundred ninety-six thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •