Base | Representation |
---|---|
bin | 111100010001011… |
… | …101011100011101 |
3 | 2121110202210100201 |
4 | 330101131130131 |
5 | 4032332210023 |
6 | 244201423501 |
7 | 34026100102 |
oct | 7421353435 |
9 | 2543683321 |
10 | 1011210013 |
11 | 479890060 |
12 | 24279ab91 |
13 | 131663728 |
14 | 98428aa9 |
15 | 5db97bad |
hex | 3c45d71d |
1011210013 has 4 divisors (see below), whose sum is σ = 1103138208. Its totient is φ = 919281820.
The previous prime is 1011209971. The next prime is 1011210023. The reversal of 1011210013 is 3100121101.
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-1011210013 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 (1011210023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45964081 + ... + 45964102.
It is an arithmetic number, because the mean of its divisors is an integer number (275784552).
Almost surely, 21011210013 is an apocalyptic number.
It is an amenable number.
1011210013 is a deficient number, since it is larger than the sum of its proper divisors (91928195).
1011210013 is an equidigital number, since it uses as much as digits as its factorization.
1011210013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91928194.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 1011210013 is about 31799.5285027939. The cubic root of 1011210013 is about 1003.7227946020.
Adding to 1011210013 its reverse (3100121101), we get a palindrome (4111331114).
The spelling of 1011210013 in words is "one billion, eleven million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •