Base | Representation |
---|---|
bin | 1011110100111001001100… |
… | …0000010100110111010011 |
3 | 1201001002212120220000001001 |
4 | 2331032103000110313103 |
5 | 3201021311034404303 |
6 | 43353352020122431 |
7 | 2511313461133021 |
oct | 275162300246723 |
9 | 51032776800031 |
10 | 13003332341203 |
11 | 4163756123a96 |
12 | 1560171836417 |
13 | 734294182249 |
14 | 32d51681d711 |
15 | 1783a6ec731d |
hex | bd393014dd3 |
13003332341203 has 2 divisors, whose sum is σ = 13003332341204. Its totient is φ = 13003332341202.
The previous prime is 13003332341189. The next prime is 13003332341213. The reversal of 13003332341203 is 30214323330031.
13003332341203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13003332341203 - 237 = 12865893387731 is a prime.
It is a super-3 number, since 3×130033323412033 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (13003332341213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6501666170601 + 6501666170602.
It is an arithmetic number, because the mean of its divisors is an integer number (6501666170602).
Almost surely, 213003332341203 is an apocalyptic number.
13003332341203 is a deficient number, since it is larger than the sum of its proper divisors (1).
13003332341203 is an equidigital number, since it uses as much as digits as its factorization.
13003332341203 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 13003332341203 its reverse (30214323330031), we get a palindrome (43217655671234).
The spelling of 13003332341203 in words is "thirteen trillion, three billion, three hundred thirty-two million, three hundred forty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •