Base | Representation |
---|---|
bin | 101101011110100010110001… |
… | …110111010111101000101111 |
3 | 222020011212101221211001212122 |
4 | 231132202301313113220233 |
5 | 202203440032401401340 |
6 | 1545215443350223155 |
7 | 60062214362312021 |
oct | 5536426167275057 |
9 | 866155357731778 |
10 | 200011021122095 |
11 | 5880321a168517 |
12 | 1a523586354abb |
13 | 877ac5c6a05c1 |
14 | 3756829632011 |
15 | 181cb2b901db5 |
hex | b5e8b1dd7a2f |
200011021122095 has 8 divisors (see below), whose sum is σ = 240044644848480. Its totient is φ = 159987870563040.
The previous prime is 200011021122071. The next prime is 200011021122113. The reversal of 200011021122095 is 590221120110002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200011021122095 - 220 = 200011020073519 is a prime.
It is a super-4 number, since 4×2000110211220954 (a number of 58 digits) contains 4444 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2618249816 + ... + 2618326205.
It is an arithmetic number, because the mean of its divisors is an integer number (30005580606060).
Almost surely, 2200011021122095 is an apocalyptic number.
200011021122095 is a deficient number, since it is larger than the sum of its proper divisors (40033623726385).
200011021122095 is an equidigital number, since it uses as much as digits as its factorization.
200011021122095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5236583665.
The product of its (nonzero) digits is 720, while the sum is 26.
Adding to 200011021122095 its reverse (590221120110002), we get a palindrome (790232141232097).
The spelling of 200011021122095 in words is "two hundred trillion, eleven billion, twenty-one million, one hundred twenty-two thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •