Base | Representation |
---|---|
bin | 101101110000000000010110… |
… | …110001101100101110010001 |
3 | 222101102120210020121121221001 |
4 | 231300000112301230232101 |
5 | 202333120122030310001 |
6 | 1551535021212502001 |
7 | 60245005254464215 |
oct | 5560002661545621 |
9 | 871376706547831 |
10 | 201211010010001 |
11 | 59126123654962 |
12 | 1a69806017a901 |
13 | 88371698974b4 |
14 | 37989444a6945 |
15 | 183de60645001 |
hex | b70016c6cb91 |
201211010010001 has 8 divisors (see below), whose sum is σ = 201451892221440. Its totient is φ = 200970130323552.
The previous prime is 201211010009983. The next prime is 201211010010007. The reversal of 201211010010001 is 100010010112102.
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 201211010010001 - 215 = 201211009977233 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201211010010001.
It is not an unprimeable number, because it can be changed into a prime (201211010010007) 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, 195126301 + ... + 196154773.
It is an arithmetic number, because the mean of its divisors is an integer number (25181486527680).
Almost surely, 2201211010010001 is an apocalyptic number.
It is an amenable number.
201211010010001 is a deficient number, since it is larger than the sum of its proper divisors (240882211439).
201211010010001 is a wasteful number, since it uses less digits than its factorization.
201211010010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1262495.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 201211010010001 its reverse (100010010112102), we get a palindrome (301221020122103).
The spelling of 201211010010001 in words is "two hundred one trillion, two hundred eleven billion, ten million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •