Base | Representation |
---|---|
bin | 100111000100100… |
… | …1001001111111110 |
3 | 10101100220201101102 |
4 | 1032021021033332 |
5 | 10141110120110 |
6 | 334031413102 |
7 | 44326325555 |
oct | 11611111776 |
9 | 3340821342 |
10 | 1311020030 |
11 | 613044831 |
12 | 307084192 |
13 | 17b7c5bc8 |
14 | c618cd9c |
15 | 7a16a5a5 |
hex | 4e2493fe |
1311020030 has 8 divisors (see below), whose sum is σ = 2359836072. Its totient is φ = 524408008.
The previous prime is 1311020017. The next prime is 1311020047. The reversal of 1311020030 is 300201131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×13110200302 = 3437547038122401800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1311019993 and 1311020020.
It is a congruent number.
It is an unprimeable number.
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, 65550992 + ... + 65551011.
It is an arithmetic number, because the mean of its divisors is an integer number (294979509).
Almost surely, 21311020030 is an apocalyptic number.
1311020030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1311020030 is a deficient number, since it is larger than the sum of its proper divisors (1048816042).
1311020030 is a wasteful number, since it uses less digits than its factorization.
1311020030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131102010.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 1311020030 is about 36208.0105777713. The cubic root of 1311020030 is about 1094.4681027712.
Adding to 1311020030 its reverse (300201131), we get a palindrome (1611221161).
The spelling of 1311020030 in words is "one billion, three hundred eleven million, twenty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •