Base | Representation |
---|---|
bin | 101110001110100100010100… |
… | …011110000010110110110011 |
3 | 222122212100202211000011120201 |
4 | 232032210110132002312303 |
5 | 203122022324314423331 |
6 | 2000223514114020031 |
7 | 60552515215501051 |
oct | 5616442436026663 |
9 | 878770684004521 |
10 | 203311210311091 |
11 | 598658889a9a33 |
12 | 1a9770a8b77617 |
13 | 895a21b29c64c |
14 | 382c45a8371d1 |
15 | 18788d0225a61 |
hex | b8e914782db3 |
203311210311091 has 2 divisors, whose sum is σ = 203311210311092. Its totient is φ = 203311210311090.
The previous prime is 203311210311061. The next prime is 203311210311137. The reversal of 203311210311091 is 190113012113302.
203311210311091 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 203311210311091 - 219 = 203311209786803 is a prime.
It is a super-2 number, since 2×2033112103110912 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (203311210311061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101655605155545 + 101655605155546.
It is an arithmetic number, because the mean of its divisors is an integer number (101655605155546).
Almost surely, 2203311210311091 is an apocalyptic number.
203311210311091 is a deficient number, since it is larger than the sum of its proper divisors (1).
203311210311091 is an equidigital number, since it uses as much as digits as its factorization.
203311210311091 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 28.
Adding to 203311210311091 its reverse (190113012113302), we get a palindrome (393424222424393).
The spelling of 203311210311091 in words is "two hundred three trillion, three hundred eleven billion, two hundred ten million, three hundred eleven thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •