Base | Representation |
---|---|
bin | 1001000001111110… |
… | …00011010111101001 |
3 | 110111220001120022011 |
4 | 10200333003113221 |
5 | 34412140221311 |
6 | 2121033155521 |
7 | 231101303665 |
oct | 44077032751 |
9 | 13456046264 |
10 | 4848367081 |
11 | 206885aa48 |
12 | b3385bba1 |
13 | 5c360a67c |
14 | 33dcad8a5 |
15 | 1d59a3321 |
hex | 120fc35e9 |
4848367081 has 2 divisors, whose sum is σ = 4848367082. Its totient is φ = 4848367080.
The previous prime is 4848367079. The next prime is 4848367141. The reversal of 4848367081 is 1807638484.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4824552681 + 23814400 = 69459^2 + 4880^2 .
It is a cyclic number.
It is not a de Polignac number, because 4848367081 - 21 = 4848367079 is a prime.
It is a super-2 number, since 2×48483670812 = 47013326704248921122, which contains 22 as substring.
Together with 4848367079, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (4848367981) 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, 2424183540 + 2424183541.
It is an arithmetic number, because the mean of its divisors is an integer number (2424183541).
Almost surely, 24848367081 is an apocalyptic number.
It is an amenable number.
4848367081 is a deficient number, since it is larger than the sum of its proper divisors (1).
4848367081 is an equidigital number, since it uses as much as digits as its factorization.
4848367081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1032192, while the sum is 49.
The square root of 4848367081 is about 69630.2167237759. The cubic root of 4848367081 is about 1692.5122912706.
The spelling of 4848367081 in words is "four billion, eight hundred forty-eight million, three hundred sixty-seven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •