Base | Representation |
---|---|
bin | 1001001001101010… |
… | …00000010110010101 |
3 | 110200101101020110001 |
4 | 10210311000112111 |
5 | 40030141422013 |
6 | 2131255131301 |
7 | 232513316623 |
oct | 44465002625 |
9 | 13611336401 |
10 | 4912842133 |
11 | 20a1198011 |
12 | b51373b31 |
13 | 603a934a4 |
14 | 348694513 |
15 | 1db48bddd |
hex | 124d40595 |
4912842133 has 2 divisors, whose sum is σ = 4912842134. Its totient is φ = 4912842132.
The previous prime is 4912842131. The next prime is 4912842163. The reversal of 4912842133 is 3312482194.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4416532849 + 496309284 = 66457^2 + 22278^2 .
It is a cyclic number.
It is not a de Polignac number, because 4912842133 - 21 = 4912842131 is a prime.
Together with 4912842131, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 4912842092 and 4912842101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4912842131) 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 as a sum of consecutive naturals, namely, 2456421066 + 2456421067.
It is an arithmetic number, because the mean of its divisors is an integer number (2456421067).
Almost surely, 24912842133 is an apocalyptic number.
It is an amenable number.
4912842133 is a deficient number, since it is larger than the sum of its proper divisors (1).
4912842133 is an equidigital number, since it uses as much as digits as its factorization.
4912842133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41472, while the sum is 37.
The square root of 4912842133 is about 70091.6694978797. The cubic root of 4912842133 is about 1699.9817913851.
The spelling of 4912842133 in words is "four billion, nine hundred twelve million, eight hundred forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •