Base | Representation |
---|---|
bin | 1011110100111001000111… |
… | …0011001100100101011011 |
3 | 1201001002211011211202210012 |
4 | 2331032101303030211123 |
5 | 3201021240400402303 |
6 | 43353350014512135 |
7 | 2511313124232344 |
oct | 275162163144533 |
9 | 51032734752705 |
10 | 13003312122203 |
11 | 4163745774177 |
12 | 1560166b0564b |
13 | 73428cc23240 |
14 | 32d513c790cb |
15 | 1783a53315d8 |
hex | bd391ccc95b |
13003312122203 has 16 divisors (see below), whose sum is σ = 14740726738080. Its totient is φ = 11371217197824.
The previous prime is 13003312122169. The next prime is 13003312122209. The reversal of 13003312122203 is 30222121330031.
It is a cyclic number.
It is not a de Polignac number, because 13003312122203 - 228 = 13003043686747 is a prime.
It is a super-2 number, since 2×130033121222032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13003312122209) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48488975 + ... + 48756407.
It is an arithmetic number, because the mean of its divisors is an integer number (921295421130).
Almost surely, 213003312122203 is an apocalyptic number.
13003312122203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13003312122203 is a deficient number, since it is larger than the sum of its proper divisors (1737414615877).
13003312122203 is a wasteful number, since it uses less digits than its factorization.
13003312122203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 464318.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13003312122203 its reverse (30222121330031), we get a palindrome (43225433452234).
The spelling of 13003312122203 in words is "thirteen trillion, three billion, three hundred twelve million, one hundred twenty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •