Base | Representation |
---|---|
bin | 1001000010100011… |
… | …10011101000100001 |
3 | 110112020022100011121 |
4 | 10201101303220201 |
5 | 34414420031421 |
6 | 2121330412241 |
7 | 231161141113 |
oct | 44121635041 |
9 | 13466270147 |
10 | 4853283361 |
11 | 2070608693 |
12 | b35431081 |
13 | 5c463c304 |
14 | 3407cd3b3 |
15 | 1d6124d41 |
hex | 121473a21 |
4853283361 has 4 divisors (see below), whose sum is σ = 4854898224. Its totient is φ = 4851668500.
The previous prime is 4853283329. The next prime is 4853283401. The reversal of 4853283361 is 1633823584.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4853283361 - 25 = 4853283329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4853283311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 802915 + ... + 808936.
It is an arithmetic number, because the mean of its divisors is an integer number (1213724556).
Almost surely, 24853283361 is an apocalyptic number.
It is an amenable number.
4853283361 is a deficient number, since it is larger than the sum of its proper divisors (1614863).
4853283361 is a wasteful number, since it uses less digits than its factorization.
4853283361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1614862.
The product of its digits is 414720, while the sum is 43.
The square root of 4853283361 is about 69665.5105557980. The cubic root of 4853283361 is about 1693.0841713352.
The spelling of 4853283361 in words is "four billion, eight hundred fifty-three million, two hundred eighty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •