Base | Representation |
---|---|
bin | 1111011110001010… |
… | …1000011111111101 |
3 | 101201102200212010122 |
4 | 3313202220133331 |
5 | 32001140114013 |
6 | 1524034144325 |
7 | 204626231540 |
oct | 36742503775 |
9 | 11642625118 |
10 | 4153051133 |
11 | 184131a870 |
12 | 97aa220a5 |
13 | 51254b30a |
14 | 2b57d4857 |
15 | 194908a08 |
hex | f78a87fd |
4153051133 has 8 divisors (see below), whose sum is σ = 5177830080. Its totient is φ = 3236143680.
The previous prime is 4153051127. The next prime is 4153051151. The reversal of 4153051133 is 3311503514.
4153051133 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4153051133 - 24 = 4153051117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4153051733) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26967788 + ... + 26967941.
It is an arithmetic number, because the mean of its divisors is an integer number (647228760).
Almost surely, 24153051133 is an apocalyptic number.
It is an amenable number.
4153051133 is a deficient number, since it is larger than the sum of its proper divisors (1024778947).
4153051133 is a wasteful number, since it uses less digits than its factorization.
4153051133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53935747.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 4153051133 is about 64444.1706673303. The cubic root of 4153051133 is about 1607.3943079322.
Adding to 4153051133 its reverse (3311503514), we get a palindrome (7464554647).
The spelling of 4153051133 in words is "four billion, one hundred fifty-three million, fifty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •