Base | Representation |
---|---|
bin | 1001010110101011… |
… | …00011110000110011 |
3 | 110221222212000111211 |
4 | 10223111203300303 |
5 | 40241120222331 |
6 | 2150155420551 |
7 | 235310425246 |
oct | 45325436063 |
9 | 13858760454 |
10 | 5022039091 |
11 | 21478a0333 |
12 | b81a54757 |
13 | 6205a7184 |
14 | 358d9b25d |
15 | 1e5d5b8b1 |
hex | 12b563c33 |
5022039091 has 4 divisors (see below), whose sum is σ = 5184040384. Its totient is φ = 4860037800.
The previous prime is 5022039079. The next prime is 5022039107. The reversal of 5022039091 is 1909302205.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5022039091 - 219 = 5021514803 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31), and also a Moran number because the ratio is a prime number: 162001261 = 5022039091 / (5 + 0 + 2 + 2 + 0 + 3 + 9 + 0 + 9 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5022039031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 81000600 + ... + 81000661.
It is an arithmetic number, because the mean of its divisors is an integer number (1296010096).
Almost surely, 25022039091 is an apocalyptic number.
5022039091 is a deficient number, since it is larger than the sum of its proper divisors (162001293).
5022039091 is a wasteful number, since it uses less digits than its factorization.
5022039091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162001292.
The product of its (nonzero) digits is 4860, while the sum is 31.
The square root of 5022039091 is about 70866.3466745676. The cubic root of 5022039091 is about 1712.4846852911.
The spelling of 5022039091 in words is "five billion, twenty-two million, thirty-nine thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •