Base | Representation |
---|---|
bin | 101101011110100011000011… |
… | …001001111011110001111001 |
3 | 222020011220011011122121212122 |
4 | 231132203003021323301321 |
5 | 202203441131131421101 |
6 | 1545215532231451025 |
7 | 60062224514042210 |
oct | 5536430311736171 |
9 | 866156134577778 |
10 | 200011311201401 |
11 | 58803358986387 |
12 | 1a523647526a75 |
13 | 877aca780696b |
14 | 3756855d82077 |
15 | 181cb4710151b |
hex | b5e8c327bc79 |
200011311201401 has 8 divisors (see below), whose sum is σ = 228587137384704. Its totient is φ = 171436180449600.
The previous prime is 200011311201391. The next prime is 200011311201451. The reversal of 200011311201401 is 104102113110002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200011311201401 - 230 = 200010237459577 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200011311201401.
It is not an unprimeable number, because it can be changed into a prime (200011311201451) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 173241425 + ... + 174392126.
It is an arithmetic number, because the mean of its divisors is an integer number (28573392173088).
Almost surely, 2200011311201401 is an apocalyptic number.
It is an amenable number.
200011311201401 is a deficient number, since it is larger than the sum of its proper divisors (28575826183303).
200011311201401 is an equidigital number, since it uses as much as digits as its factorization.
200011311201401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347715751.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 200011311201401 its reverse (104102113110002), we get a palindrome (304113424311403).
The spelling of 200011311201401 in words is "two hundred trillion, eleven billion, three hundred eleven million, two hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •