Base | Representation |
---|---|
bin | 10101000110011001… |
… | …11001010011111001 |
3 | 1002020110122002101201 |
4 | 22203030321103321 |
5 | 141144432020043 |
6 | 5112022214201 |
7 | 550501264531 |
oct | 124314712371 |
9 | 32213562351 |
10 | 11328001273 |
11 | 48933a8026 |
12 | 2241884361 |
13 | 10b6b7a744 |
14 | 7966924c1 |
15 | 46477ec4d |
hex | 2a33394f9 |
11328001273 has 2 divisors, whose sum is σ = 11328001274. Its totient is φ = 11328001272.
The previous prime is 11328001271. The next prime is 11328001277. The reversal of 11328001273 is 37210082311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8565132304 + 2762868969 = 92548^2 + 52563^2 .
It is a cyclic number.
It is not a de Polignac number, because 11328001273 - 21 = 11328001271 is a prime.
It is a super-2 number, since 2×113280012732 (a number of 21 digits) contains 22 as substring.
Together with 11328001271, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11328001271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5664000636 + 5664000637.
It is an arithmetic number, because the mean of its divisors is an integer number (5664000637).
Almost surely, 211328001273 is an apocalyptic number.
It is an amenable number.
11328001273 is a deficient number, since it is larger than the sum of its proper divisors (1).
11328001273 is an equidigital number, since it uses as much as digits as its factorization.
11328001273 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016, while the sum is 28.
Adding to 11328001273 its reverse (37210082311), we get a palindrome (48538083584).
It can be divided in two parts, 113 and 28001273, that added together give a triangular number (28001386 = T7483).
The spelling of 11328001273 in words is "eleven billion, three hundred twenty-eight million, one thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •