Base | Representation |
---|---|
bin | 1011110100101001111… |
… | …1110101101000000101 |
3 | 201102021022112212210011 |
4 | 2331022133311220011 |
5 | 11311434002314023 |
6 | 233150423230221 |
7 | 20450223521326 |
oct | 2751237655005 |
9 | 642238485704 |
10 | 203113323013 |
11 | 7915a1a2927 |
12 | 334462a8371 |
13 | 161cc330443 |
14 | 9b8b78644d |
15 | 543b95050d |
hex | 2f4a7f5a05 |
203113323013 has 2 divisors, whose sum is σ = 203113323014. Its totient is φ = 203113323012.
The previous prime is 203113322849. The next prime is 203113323031. The reversal of 203113323013 is 310323311302.
Together with next prime (203113323031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 191548901569 + 11564421444 = 437663^2 + 107538^2 .
It is a cyclic number.
It is not a de Polignac number, because 203113323013 - 225 = 203079768581 is a prime.
It is a super-3 number, since 3×2031133230133 (a number of 35 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203113323053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101556661506 + 101556661507.
It is an arithmetic number, because the mean of its divisors is an integer number (101556661507).
Almost surely, 2203113323013 is an apocalyptic number.
It is an amenable number.
203113323013 is a deficient number, since it is larger than the sum of its proper divisors (1).
203113323013 is an equidigital number, since it uses as much as digits as its factorization.
203113323013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 203113323013 its reverse (310323311302), we get a palindrome (513436634315).
The spelling of 203113323013 in words is "two hundred three billion, one hundred thirteen million, three hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •