Base | Representation |
---|---|
bin | 1111100001000001… |
… | …1010101001111111 |
3 | 101202021021121200021 |
4 | 3320100122221333 |
5 | 32012223144210 |
6 | 1525143313011 |
7 | 205133236552 |
oct | 37020325177 |
9 | 11667247607 |
10 | 4165053055 |
11 | 1848078009 |
12 | 982a4b767 |
13 | 514b91147 |
14 | 2b723a699 |
15 | 1959c9bda |
hex | f841aa7f |
4165053055 has 4 divisors (see below), whose sum is σ = 4998063672. Its totient is φ = 3332042440.
The previous prime is 4165053043. The next prime is 4165053073. The reversal of 4165053055 is 5503505614.
4165053055 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 a de Polignac number, because none of the positive numbers 2k-4165053055 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 4165053055.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 416505301 + ... + 416505310.
It is an arithmetic number, because the mean of its divisors is an integer number (1249515918).
Almost surely, 24165053055 is an apocalyptic number.
4165053055 is a deficient number, since it is larger than the sum of its proper divisors (833010617).
4165053055 is an equidigital number, since it uses as much as digits as its factorization.
4165053055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 833010616.
The product of its (nonzero) digits is 45000, while the sum is 34.
The square root of 4165053055 is about 64537.2222442212. Note that the first 4 decimals coincide. The cubic root of 4165053055 is about 1608.9412241975.
Adding to 4165053055 its reverse (5503505614), we get a palindrome (9668558669).
The spelling of 4165053055 in words is "four billion, one hundred sixty-five million, fifty-three thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •