Base | Representation |
---|---|
bin | 1001001100001011… |
… | …01111000100101001 |
3 | 110201212012102111011 |
4 | 10212011233010221 |
5 | 40101101130113 |
6 | 2133332503521 |
7 | 233161231216 |
oct | 44605570451 |
9 | 13655172434 |
10 | 4934005033 |
11 | 2102132011 |
12 | b5847aba1 |
13 | 608293009 |
14 | 34b402b0d |
15 | 1dd26c63d |
hex | 12616f129 |
4934005033 has 4 divisors (see below), whose sum is σ = 4934150100. Its totient is φ = 4933859968.
The previous prime is 4934005003. The next prime is 4934005039. The reversal of 4934005033 is 3305004394.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 4862551824 + 71453209 = 69732^2 + 8453^2 .
It is a cyclic number.
It is not a de Polignac number, because 4934005033 - 25 = 4934005001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4934004986 and 4934005004.
It is not an unprimeable number, because it can be changed into a prime (4934005039) 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, 9141 + ... + 99757.
It is an arithmetic number, because the mean of its divisors is an integer number (1233537525).
Almost surely, 24934005033 is an apocalyptic number.
It is an amenable number.
4934005033 is a deficient number, since it is larger than the sum of its proper divisors (145067).
4934005033 is an equidigital number, since it uses as much as digits as its factorization.
4934005033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145066.
The product of its (nonzero) digits is 19440, while the sum is 31.
The square root of 4934005033 is about 70242.4731412555. The cubic root of 4934005033 is about 1702.4192813077.
The spelling of 4934005033 in words is "four billion, nine hundred thirty-four million, five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •