Base | Representation |
---|---|
bin | 1111101100111101… |
… | …1010000011110001 |
3 | 101212202111021202202 |
4 | 3323033122003301 |
5 | 32113032320423 |
6 | 1534132352545 |
7 | 206311633631 |
oct | 37317320361 |
9 | 11782437682 |
10 | 4215120113 |
11 | 1873364146 |
12 | 997775755 |
13 | 522370c19 |
14 | 2bdb506c1 |
15 | 19a0b9728 |
hex | fb3da0f1 |
4215120113 has 6 divisors (see below), whose sum is σ = 4448645154. Its totient is φ = 3993271344.
The previous prime is 4215120109. The next prime is 4215120121. The reversal of 4215120113 is 3110215124.
It can be written as a sum of positive squares in only one way, i.e., 4153544704 + 61575409 = 64448^2 + 7847^2 .
It is not a de Polignac number, because 4215120113 - 22 = 4215120109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4215125113) 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 5 ways as a sum of consecutive naturals, for example, 5837756 + ... + 5838477.
It is an arithmetic number, because the mean of its divisors is an integer number (741440859).
Almost surely, 24215120113 is an apocalyptic number.
It is an amenable number.
4215120113 is a deficient number, since it is larger than the sum of its proper divisors (233525041).
4215120113 is a wasteful number, since it uses less digits than its factorization.
4215120113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11676271 (or 11676252 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 20.
The square root of 4215120113 is about 64923.9563874538. The cubic root of 4215120113 is about 1615.3624561331.
Adding to 4215120113 its reverse (3110215124), we get a palindrome (7325335237).
The spelling of 4215120113 in words is "four billion, two hundred fifteen million, one hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •