Base | Representation |
---|---|
bin | 1100000110001011011111… |
… | …0101100111001011111001 |
3 | 1202002111101222122020021001 |
4 | 3001202313311213023321 |
5 | 3220403010034024311 |
6 | 44142024100445001 |
7 | 2541625623305311 |
oct | 301426765471371 |
9 | 52074358566231 |
10 | 13300303033081 |
11 | 4268699362259 |
12 | 15a98306a9761 |
13 | 7562a050752c |
14 | 33da494ca441 |
15 | 180e887534c1 |
hex | c18b7d672f9 |
13300303033081 has 2 divisors, whose sum is σ = 13300303033082. Its totient is φ = 13300303033080.
The previous prime is 13300303033079. The next prime is 13300303033093. The reversal of 13300303033081 is 18033030300331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6983022936681 + 6317280096400 = 2642541^2 + 2513420^2 .
It is an emirp because it is prime and its reverse (18033030300331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13300303033081 - 21 = 13300303033079 is a prime.
It is a super-2 number, since 2×133003030330812 (a number of 27 digits) contains 22 as substring.
Together with 13300303033079, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (13300303063081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650151516540 + 6650151516541.
It is an arithmetic number, because the mean of its divisors is an integer number (6650151516541).
Almost surely, 213300303033081 is an apocalyptic number.
It is an amenable number.
13300303033081 is a deficient number, since it is larger than the sum of its proper divisors (1).
13300303033081 is an equidigital number, since it uses as much as digits as its factorization.
13300303033081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 28.
The spelling of 13300303033081 in words is "thirteen trillion, three hundred billion, three hundred three million, thirty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •