Base | Representation |
---|---|
bin | 1111011101100011… |
… | …1010111001011011 |
3 | 101201020220111120022 |
4 | 3313120322321123 |
5 | 32000012130201 |
6 | 1523503421055 |
7 | 204565465550 |
oct | 36730727133 |
9 | 11636814508 |
10 | 4150505051 |
11 | 183a940970 |
12 | 979bb478b |
13 | 511b69464 |
14 | 2b5330a27 |
15 | 1945a441b |
hex | f763ae5b |
4150505051 has 8 divisors (see below), whose sum is σ = 5174655744. Its totient is φ = 3234159720.
The previous prime is 4150505017. The next prime is 4150505053. The reversal of 4150505051 is 1505050514.
4150505051 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 4150505051 - 26 = 4150504987 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 4150505051.
It is not an unprimeable number, because it can be changed into a prime (4150505053) 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, 26951255 + ... + 26951408.
It is an arithmetic number, because the mean of its divisors is an integer number (646831968).
Almost surely, 24150505051 is an apocalyptic number.
4150505051 is a deficient number, since it is larger than the sum of its proper divisors (1024150693).
4150505051 is a wasteful number, since it uses less digits than its factorization.
4150505051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53902681.
The product of its (nonzero) digits is 2500, while the sum is 26.
The square root of 4150505051 is about 64424.4134703608. The cubic root of 4150505051 is about 1607.0657627895.
Adding to 4150505051 its reverse (1505050514), we get a palindrome (5655555565).
The spelling of 4150505051 in words is "four billion, one hundred fifty million, five hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •