Base | Representation |
---|---|
bin | 10101000100110000… |
… | …10000000111000111 |
3 | 1002012111122222000122 |
4 | 22202120100013013 |
5 | 141132413413111 |
6 | 5110410332155 |
7 | 550243056560 |
oct | 124230200707 |
9 | 32174588018 |
10 | 11314201031 |
11 | 4886631771 |
12 | 223912a05b |
13 | 10b4058213 |
14 | 7948dd167 |
15 | 463455cdb |
hex | 2a26101c7 |
11314201031 has 4 divisors (see below), whose sum is σ = 12930515472. Its totient is φ = 9697886592.
The previous prime is 11314200973. The next prime is 11314201081. The reversal of 11314201031 is 13010241311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13010241311 = 173 ⋅75203707.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11314201031 is a prime.
It is a super-2 number, since 2×113142010312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11314201081) 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 3 ways as a sum of consecutive naturals, for example, 808157210 + ... + 808157223.
It is an arithmetic number, because the mean of its divisors is an integer number (3232628868).
Almost surely, 211314201031 is an apocalyptic number.
11314201031 is a deficient number, since it is larger than the sum of its proper divisors (1616314441).
11314201031 is an equidigital number, since it uses as much as digits as its factorization.
11314201031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1616314440.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11314201031 its reverse (13010241311), we get a palindrome (24324442342).
The spelling of 11314201031 in words is "eleven billion, three hundred fourteen million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •