Base | Representation |
---|---|
bin | 10101000100110000… |
… | …10000001011101010 |
3 | 1002012111122222102102 |
4 | 22202120100023222 |
5 | 141132413420242 |
6 | 5110410333402 |
7 | 550243060454 |
oct | 124230201352 |
9 | 32174588372 |
10 | 11314201322 |
11 | 4886631a06 |
12 | 223912a262 |
13 | 10b40583a8 |
14 | 7948dd2d4 |
15 | 463455e32 |
hex | 2a26102ea |
11314201322 has 4 divisors (see below), whose sum is σ = 16971301986. Its totient is φ = 5657100660.
The previous prime is 11314201321. The next prime is 11314201333. The reversal of 11314201322 is 22310241311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 22310241311 = 130409 ⋅171079.
It can be written as a sum of positive squares in only one way, i.e., 8463816001 + 2850385321 = 91999^2 + 53389^2 .
It is a super-2 number, since 2×113142013222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11314201294 and 11314201303.
It is not an unprimeable number, because it can be changed into a prime (11314201321) 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 as a sum of consecutive naturals, namely, 2828550329 + ... + 2828550332.
Almost surely, 211314201322 is an apocalyptic number.
11314201322 is a deficient number, since it is larger than the sum of its proper divisors (5657100664).
11314201322 is an equidigital number, since it uses as much as digits as its factorization.
11314201322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5657100663.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 11314201322 its reverse (22310241311), we get a palindrome (33624442633).
The spelling of 11314201322 in words is "eleven billion, three hundred fourteen million, two hundred one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •