Base | Representation |
---|---|
bin | 1111010110101011… |
… | …0110110110000101 |
3 | 101122020121122110111 |
4 | 3311222312312011 |
5 | 31420120340423 |
6 | 1520553153021 |
7 | 204065316631 |
oct | 36552666605 |
9 | 11566548414 |
10 | 4121652613 |
11 | 1825624681 |
12 | 9703bb771 |
13 | 508ba6900 |
14 | 2b157ddc1 |
15 | 191ca560d |
hex | f5ab6d85 |
4121652613 has 12 divisors (see below), whose sum is σ = 4481654628. Its totient is φ = 3788778240.
The previous prime is 4121652593. The next prime is 4121652649. The reversal of 4121652613 is 3162561214.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 2965284 + 4118687329 = 1722^2 + 64177^2 .
It is not a de Polignac number, because 4121652613 - 213 = 4121644421 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 (4121652683) 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 11 ways as a sum of consecutive naturals, for example, 9870 + ... + 91327.
It is an arithmetic number, because the mean of its divisors is an integer number (373471219).
Almost surely, 24121652613 is an apocalyptic number.
It is an amenable number.
4121652613 is a deficient number, since it is larger than the sum of its proper divisors (360002015).
4121652613 is a wasteful number, since it uses less digits than its factorization.
4121652613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101464 (or 101451 counting only the distinct ones).
The product of its digits is 8640, while the sum is 31.
The square root of 4121652613 is about 64200.0982320121. The cubic root of 4121652613 is about 1603.3332351270. Note that the first 3 decimals are identical.
The spelling of 4121652613 in words is "four billion, one hundred twenty-one million, six hundred fifty-two thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •