Base | Representation |
---|---|
bin | 1001000010000111… |
… | …11111000000111001 |
3 | 110111222111020210121 |
4 | 10201003333000321 |
5 | 34413003104321 |
6 | 2121121013241 |
7 | 231115300216 |
oct | 44103770071 |
9 | 13458436717 |
10 | 4849659961 |
11 | 2069563343 |
12 | b34184221 |
13 | 5c3970ca3 |
14 | 340128b0d |
15 | 1d5b5b441 |
hex | 1210ff039 |
4849659961 has 4 divisors (see below), whose sum is σ = 4850994832. Its totient is φ = 4848325092.
The previous prime is 4849659943. The next prime is 4849660021. The reversal of 4849659961 is 1699569484.
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 4849659961 - 215 = 4849627193 is a prime.
It is the 69640-th Hogben number.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4849659961.
It is not an unprimeable number, because it can be changed into a prime (4849639961) by changing a digit.
It is a nontrivial repunit in base 69639.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 661971 + ... + 669256.
It is an arithmetic number, because the mean of its divisors is an integer number (1212748708).
Almost surely, 24849659961 is an apocalyptic number.
It is an amenable number.
4849659961 is a deficient number, since it is larger than the sum of its proper divisors (1334871).
4849659961 is a wasteful number, since it uses less digits than its factorization.
4849659961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1334870.
The product of its digits is 16796160, while the sum is 61.
The square root of 4849659961 is about 69639.5000053849. The cubic root of 4849659961 is about 1692.6627213555.
The spelling of 4849659961 in words is "four billion, eight hundred forty-nine million, six hundred fifty-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •