Base | Representation |
---|---|
bin | 1000110011111101… |
… | …01010110010011001 |
3 | 110012200212212002101 |
4 | 10121332222302121 |
5 | 34142042412011 |
6 | 2101234003401 |
7 | 225143233165 |
oct | 43176526231 |
9 | 13180785071 |
10 | 4730825881 |
11 | 2008478561 |
12 | b00416561 |
13 | 5a5164972 |
14 | 32c433ca5 |
15 | 1ca4d62c1 |
hex | 119faac99 |
4730825881 has 2 divisors, whose sum is σ = 4730825882. Its totient is φ = 4730825880.
The previous prime is 4730825867. The next prime is 4730825963. The reversal of 4730825881 is 1885280374.
4730825881 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4472934400 + 257891481 = 66880^2 + 16059^2 .
It is a cyclic number.
It is not a de Polignac number, because 4730825881 - 25 = 4730825849 is a prime.
It is a super-2 number, since 2×47308258812 = 44761427032678852322, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4730825821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2365412940 + 2365412941.
It is an arithmetic number, because the mean of its divisors is an integer number (2365412941).
Almost surely, 24730825881 is an apocalyptic number.
It is an amenable number.
4730825881 is a deficient number, since it is larger than the sum of its proper divisors (1).
4730825881 is an equidigital number, since it uses as much as digits as its factorization.
4730825881 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 430080, while the sum is 46.
The square root of 4730825881 is about 68780.9994184440. Note that the first 3 decimals coincide. The cubic root of 4730825881 is about 1678.7227963894.
The spelling of 4730825881 in words is "four billion, seven hundred thirty million, eight hundred twenty-five thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •