Base | Representation |
---|---|
bin | 1001000110000101010101… |
… | …10010101001000000111011 |
3 | 2121211000002122010211202122 |
4 | 10203002222302221000323 |
5 | 10110140434140211331 |
6 | 110311551422551455 |
7 | 4132653264431162 |
oct | 443025262510073 |
9 | 77730078124678 |
10 | 20000233132091 |
11 | 641106221a693 |
12 | 22b021973858b |
13 | b2102469b814 |
14 | 4d20331c63d9 |
15 | 24a3ba58717b |
hex | 1230aaca903b |
20000233132091 has 2 divisors, whose sum is σ = 20000233132092. Its totient is φ = 20000233132090.
The previous prime is 20000233131959. The next prime is 20000233132093. The reversal of 20000233132091 is 19023133200002.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20000233132091 is a prime.
Together with 20000233132093, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20000233132091.
It is not a weakly prime, because it can be changed into another prime (20000233132093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000116566045 + 10000116566046.
It is an arithmetic number, because the mean of its divisors is an integer number (10000116566046).
Almost surely, 220000233132091 is an apocalyptic number.
20000233132091 is a deficient number, since it is larger than the sum of its proper divisors (1).
20000233132091 is an equidigital number, since it uses as much as digits as its factorization.
20000233132091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 20000233132091 its reverse (19023133200002), we get a palindrome (39023366332093).
The spelling of 20000233132091 in words is "twenty trillion, two hundred thirty-three million, one hundred thirty-two thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •