Base | Representation |
---|---|
bin | 1001010110101011… |
… | …10101110100001001 |
3 | 110221222222202221102 |
4 | 10223111311310021 |
5 | 40241130104113 |
6 | 2150201151145 |
7 | 235311153650 |
oct | 45325656411 |
9 | 13858882842 |
10 | 5022113033 |
11 | 2147940943 |
12 | b81a8b4b5 |
13 | 620601a22 |
14 | 358dba197 |
15 | 1e5d73758 |
hex | 12b575d09 |
5022113033 has 8 divisors (see below), whose sum is σ = 5740775040. Its totient is φ = 4303755360.
The previous prime is 5022113009. The next prime is 5022113039. The reversal of 5022113033 is 3303112205.
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 5022113033 - 214 = 5022096649 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5022112996 and 5022113014.
It is not an unprimeable number, because it can be changed into a prime (5022113039) 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 7 ways as a sum of consecutive naturals, for example, 39548 + ... + 107741.
It is an arithmetic number, because the mean of its divisors is an integer number (717596880).
Almost surely, 25022113033 is an apocalyptic number.
It is an amenable number.
5022113033 is a deficient number, since it is larger than the sum of its proper divisors (718662007).
5022113033 is a wasteful number, since it uses less digits than its factorization.
5022113033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152167.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 5022113033 is about 70866.8683730275. The cubic root of 5022113033 is about 1712.4930898402.
Adding to 5022113033 its reverse (3303112205), we get a palindrome (8325225238).
The spelling of 5022113033 in words is "five billion, twenty-two million, one hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •