Base | Representation |
---|---|
bin | 101110001110100100010101… |
… | …101100111110001011100001 |
3 | 222122212100211020221100020020 |
4 | 232032210111230332023201 |
5 | 203122022400114020223 |
6 | 2000223520133304053 |
7 | 60552515556403311 |
oct | 5616442554761341 |
9 | 878770736840206 |
10 | 203311231001313 |
11 | 59865899650896 |
12 | 1a9770b3a95029 |
13 | 895a222664c96 |
14 | 382c45d4a1441 |
15 | 18788d1e611e3 |
hex | b8e915b3e2e1 |
203311231001313 has 4 divisors (see below), whose sum is σ = 271081641335088. Its totient is φ = 135540820667540.
The previous prime is 203311231001293. The next prime is 203311231001381. The reversal of 203311231001313 is 313100132113302.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 203311231001313 - 220 = 203311229952737 is a prime.
It is not an unprimeable number, because it can be changed into a prime (203311231003313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33885205166883 + ... + 33885205166888.
It is an arithmetic number, because the mean of its divisors is an integer number (67770410333772).
Almost surely, 2203311231001313 is an apocalyptic number.
It is an amenable number.
203311231001313 is a deficient number, since it is larger than the sum of its proper divisors (67770410333775).
203311231001313 is an equidigital number, since it uses as much as digits as its factorization.
203311231001313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67770410333774.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 203311231001313 its reverse (313100132113302), we get a palindrome (516411363114615).
The spelling of 203311231001313 in words is "two hundred three trillion, three hundred eleven billion, two hundred thirty-one million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •