Base | Representation |
---|---|
bin | 1001001111110000… |
… | …01010000110010011 |
3 | 110210221122100001022 |
4 | 10213320022012103 |
5 | 40131241001042 |
6 | 2140323430055 |
7 | 234004206431 |
oct | 44770120623 |
9 | 13727570038 |
10 | 4964000147 |
11 | 2118059867 |
12 | b6652532b |
13 | 6115659c2 |
14 | 3513add51 |
15 | 1e0be4cd2 |
hex | 127e0a193 |
4964000147 has 4 divisors (see below), whose sum is σ = 5124129216. Its totient is φ = 4803871080.
The previous prime is 4964000117. The next prime is 4964000177. The reversal of 4964000147 is 7410004694.
4964000147 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (4964000117) and next prime (4964000177).
It is a cyclic number.
It is not a de Polignac number, because 4964000147 - 28 = 4963999891 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4964000117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80064488 + ... + 80064549.
It is an arithmetic number, because the mean of its divisors is an integer number (1281032304).
Almost surely, 24964000147 is an apocalyptic number.
4964000147 is a deficient number, since it is larger than the sum of its proper divisors (160129069).
4964000147 is a wasteful number, since it uses less digits than its factorization.
4964000147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160129068.
The product of its (nonzero) digits is 24192, while the sum is 35.
The square root of 4964000147 is about 70455.6608584434. The cubic root of 4964000147 is about 1705.8621321939.
The spelling of 4964000147 in words is "four billion, nine hundred sixty-four million, one hundred forty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •