Base | Representation |
---|---|
bin | 100100011011010… |
… | …101010100110101 |
3 | 1120120222101100111 |
4 | 210123111110311 |
5 | 2222423120023 |
6 | 140350543021 |
7 | 21100434613 |
oct | 4433252465 |
9 | 1516871314 |
10 | 611145013 |
11 | 293a80326 |
12 | 150807a71 |
13 | 997cb68b |
14 | 5b2486b3 |
15 | 389c000d |
hex | 246d5535 |
611145013 has 4 divisors (see below), whose sum is σ = 643310560. Its totient is φ = 578979468.
The previous prime is 611145001. The next prime is 611145077. The reversal of 611145013 is 310541116.
611145013 is digitally balanced in base 2, 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-611145013 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 (611145313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16082745 + ... + 16082782.
It is an arithmetic number, because the mean of its divisors is an integer number (160827640).
Almost surely, 2611145013 is an apocalyptic number.
It is an amenable number.
611145013 is a deficient number, since it is larger than the sum of its proper divisors (32165547).
611145013 is a wasteful number, since it uses less digits than its factorization.
611145013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32165546.
The product of its (nonzero) digits is 360, while the sum is 22.
The square root of 611145013 is about 24721.3473136073. The cubic root of 611145013 is about 848.6229203798.
Adding to 611145013 its reverse (310541116), we get a palindrome (921686129).
The spelling of 611145013 in words is "six hundred eleven million, one hundred forty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •