Base | Representation |
---|---|
bin | 101101101100111100111101… |
… | …001000110010110100110011 |
3 | 222100200112020020110000022202 |
4 | 231230330331020302310303 |
5 | 202321200424222413021 |
6 | 1551254402052253415 |
7 | 60223600055520050 |
oct | 5554747510626463 |
9 | 870615206400282 |
10 | 201001200201011 |
11 | 59055148472001 |
12 | 1a66346731126b |
13 | 88204410bc522 |
14 | 378c71d610027 |
15 | 1838780d80a0b |
hex | b6cf3d232d33 |
201001200201011 has 4 divisors (see below), whose sum is σ = 229715657372592. Its totient is φ = 172286743029432.
The previous prime is 201001200200963. The next prime is 201001200201017. The reversal of 201001200201011 is 110102002100102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201001200201011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201001200200983 and 201001200201001.
It is not an unprimeable number, because it can be changed into a prime (201001200201017) 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, 14357228585780 + ... + 14357228585793.
It is an arithmetic number, because the mean of its divisors is an integer number (57428914343148).
Almost surely, 2201001200201011 is an apocalyptic number.
201001200201011 is a deficient number, since it is larger than the sum of its proper divisors (28714457171581).
201001200201011 is an equidigital number, since it uses as much as digits as its factorization.
201001200201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28714457171580.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201001200201011 its reverse (110102002100102), we get a palindrome (311103202301113).
The spelling of 201001200201011 in words is "two hundred one trillion, one billion, two hundred million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •