Base | Representation |
---|---|
bin | 1111001111011101… |
… | …0100001100110011 |
3 | 101120010121211111110 |
4 | 3303313110030303 |
5 | 31334342123042 |
6 | 1513552044403 |
7 | 203250010233 |
oct | 36367241463 |
9 | 11503554443 |
10 | 4091364147 |
11 | 180a517492 |
12 | 962233703 |
13 | 502830540 |
14 | 2ab537cc3 |
15 | 18e2c109c |
hex | f3dd4333 |
4091364147 has 16 divisors (see below), whose sum is σ = 5999777280. Its totient is φ = 2464192032.
The previous prime is 4091364139. The next prime is 4091364149. The reversal of 4091364147 is 7414631904.
It is not a de Polignac number, because 4091364147 - 23 = 4091364139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (4091364149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1114197 + ... + 1117862.
It is an arithmetic number, because the mean of its divisors is an integer number (374986080).
Almost surely, 24091364147 is an apocalyptic number.
4091364147 is a gapful number since it is divisible by the number (47) formed by its first and last digit.
4091364147 is a deficient number, since it is larger than the sum of its proper divisors (1908413133).
4091364147 is a wasteful number, since it uses less digits than its factorization.
4091364147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2232122.
The product of its (nonzero) digits is 72576, while the sum is 39.
The square root of 4091364147 is about 63963.7721448634. The cubic root of 4091364147 is about 1599.3961454358.
The spelling of 4091364147 in words is "four billion, ninety-one million, three hundred sixty-four thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •