Base | Representation |
---|---|
bin | 100111000100100… |
… | …0101000110001101 |
3 | 10101100212212001110 |
4 | 1032021011012031 |
5 | 10141104044041 |
6 | 334031202233 |
7 | 44326225146 |
oct | 11611050615 |
9 | 3340785043 |
10 | 1311003021 |
11 | 613032a79 |
12 | 307076379 |
13 | 17b7bb243 |
14 | c6186acd |
15 | 7a165516 |
hex | 4e24518d |
1311003021 has 16 divisors (see below), whose sum is σ = 1845158400. Its totient is φ = 825682608.
The previous prime is 1311003017. The next prime is 1311003037. The reversal of 1311003021 is 1203001131.
It is not a de Polignac number, because 1311003021 - 22 = 1311003017 is a prime.
It is a super-2 number, since 2×13110030212 = 3437457842142252882, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1311002988 and 1311003006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311003041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11571 + ... + 52496.
It is an arithmetic number, because the mean of its divisors is an integer number (115322400).
Almost surely, 21311003021 is an apocalyptic number.
It is an amenable number.
1311003021 is a deficient number, since it is larger than the sum of its proper divisors (534155379).
1311003021 is a wasteful number, since it uses less digits than its factorization.
1311003021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64448.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 1311003021 is about 36207.7756980459. The cubic root of 1311003021 is about 1094.4633695894.
Adding to 1311003021 its reverse (1203001131), we get a palindrome (2514004152).
The spelling of 1311003021 in words is "one billion, three hundred eleven million, three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •