Base | Representation |
---|---|
bin | 100111010111110… |
… | …1001010110110011 |
3 | 10102001220111100112 |
4 | 1032233221112303 |
5 | 10201201104021 |
6 | 335032011535 |
7 | 44511163301 |
oct | 11657512663 |
9 | 3361814315 |
10 | 1321113011 |
11 | 618808839 |
12 | 30a530bab |
13 | 18091ab9a |
14 | c7659271 |
15 | 7aeb0d5b |
hex | 4ebe95b3 |
1321113011 has 4 divisors (see below), whose sum is σ = 1321485312. Its totient is φ = 1320740712.
The previous prime is 1321112953. The next prime is 1321113049. The reversal of 1321113011 is 1103111231.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1321113011 - 214 = 1321096627 is a prime.
It is a super-2 number, since 2×13211130112 = 3490679175666972242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1321113071) 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 3 ways as a sum of consecutive naturals, for example, 180776 + ... + 187941.
It is an arithmetic number, because the mean of its divisors is an integer number (330371328).
Almost surely, 21321113011 is an apocalyptic number.
1321113011 is a deficient number, since it is larger than the sum of its proper divisors (372301).
1321113011 is an equidigital number, since it uses as much as digits as its factorization.
1321113011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372300.
The product of its (nonzero) digits is 18, while the sum is 14.
The square root of 1321113011 is about 36347.1183314441. The cubic root of 1321113011 is about 1097.2695395287.
Adding to 1321113011 its reverse (1103111231), we get a palindrome (2424224242).
The spelling of 1321113011 in words is "one billion, three hundred twenty-one million, one hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •