Base | Representation |
---|---|
bin | 1000101110001100… |
… | …10101111100110001 |
3 | 110002022221221201101 |
4 | 10113012111330301 |
5 | 34042210143113 |
6 | 2052350204401 |
7 | 224015434042 |
oct | 42706257461 |
9 | 13068857641 |
10 | 4682506033 |
11 | 1a931750a7 |
12 | aa81b3701 |
13 | 59814723a |
14 | 325c568c9 |
15 | 1c613e2dd |
hex | 117195f31 |
4682506033 has 2 divisors, whose sum is σ = 4682506034. Its totient is φ = 4682506032.
The previous prime is 4682506009. The next prime is 4682506069. The reversal of 4682506033 is 3306052864.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4604572449 + 77933584 = 67857^2 + 8828^2 .
It is a cyclic number.
It is not a de Polignac number, because 4682506033 - 25 = 4682506001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4682505983 and 4682506001.
It is not a weakly prime, because it can be changed into another prime (4682506133) 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 as a sum of consecutive naturals, namely, 2341253016 + 2341253017.
It is an arithmetic number, because the mean of its divisors is an integer number (2341253017).
Almost surely, 24682506033 is an apocalyptic number.
It is an amenable number.
4682506033 is a deficient number, since it is larger than the sum of its proper divisors (1).
4682506033 is an equidigital number, since it uses as much as digits as its factorization.
4682506033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 37.
The square root of 4682506033 is about 68428.8391907973. The cubic root of 4682506033 is about 1672.9878304948.
Adding to 4682506033 its reverse (3306052864), we get a palindrome (7988558897).
The spelling of 4682506033 in words is "four billion, six hundred eighty-two million, five hundred six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •