Base | Representation |
---|---|
bin | 1001000100100101… |
… | …10000100101001101 |
3 | 110120102100101122001 |
4 | 10202102300211031 |
5 | 34433244411341 |
6 | 2123135352301 |
7 | 231455645110 |
oct | 44222604515 |
9 | 13512311561 |
10 | 4870310221 |
11 | 207a188177 |
12 | b3b082691 |
13 | 5c802138a |
14 | 342b82577 |
15 | 1d7889d31 |
hex | 1224b094d |
4870310221 has 8 divisors (see below), whose sum is σ = 5566549824. Its totient is φ = 4174190880.
The previous prime is 4870310177. The next prime is 4870310231. The reversal of 4870310221 is 1220130784.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4870310221 - 225 = 4836755789 is a prime.
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 4870310221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4870310231) 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 7 ways as a sum of consecutive naturals, for example, 87246 + ... + 131728.
It is an arithmetic number, because the mean of its divisors is an integer number (695818728).
Almost surely, 24870310221 is an apocalyptic number.
It is an amenable number.
4870310221 is a deficient number, since it is larger than the sum of its proper divisors (696239603).
4870310221 is a wasteful number, since it uses less digits than its factorization.
4870310221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60131.
The product of its (nonzero) digits is 2688, while the sum is 28.
The square root of 4870310221 is about 69787.6079329275. The cubic root of 4870310221 is about 1695.0618194605.
The spelling of 4870310221 in words is "four billion, eight hundred seventy million, three hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •