Base | Representation |
---|---|
bin | 1010010001110111100110… |
… | …1010011011011011110011 |
3 | 1111000110200210022220221001 |
4 | 2210131321222123123303 |
5 | 2440133200112340311 |
6 | 40012040233342431 |
7 | 2244356401636465 |
oct | 244357152333363 |
9 | 44013623286831 |
10 | 11302100121331 |
11 | 3668214967478 |
12 | 132650a567a17 |
13 | 63ca25383ab6 |
14 | 2b104b596135 |
15 | 148ed84064c1 |
hex | a4779a9b6f3 |
11302100121331 has 2 divisors, whose sum is σ = 11302100121332. Its totient is φ = 11302100121330.
The previous prime is 11302100121251. The next prime is 11302100121439. The reversal of 11302100121331 is 13312100120311.
It is a weak prime.
It is an emirp because it is prime and its reverse (13312100120311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11302100121331 - 27 = 11302100121203 is a prime.
It is a super-2 number, since 2×113021001213312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11302100121299 and 11302100121308.
It is not a weakly prime, because it can be changed into another prime (11302100121031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5651050060665 + 5651050060666.
It is an arithmetic number, because the mean of its divisors is an integer number (5651050060666).
Almost surely, 211302100121331 is an apocalyptic number.
11302100121331 is a deficient number, since it is larger than the sum of its proper divisors (1).
11302100121331 is an equidigital number, since it uses as much as digits as its factorization.
11302100121331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11302100121331 its reverse (13312100120311), we get a palindrome (24614200241642).
The spelling of 11302100121331 in words is "eleven trillion, three hundred two billion, one hundred million, one hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.431 sec. • engine limits •