Base | Representation |
---|---|
bin | 101101101101000111000000… |
… | …111010100111010100111001 |
3 | 222100201120002222002000020101 |
4 | 231231013000322213110321 |
5 | 202321340034224323001 |
6 | 1551303345523155401 |
7 | 60224431526061025 |
oct | 5555070072472471 |
9 | 870646088060211 |
10 | 201012001011001 |
11 | 59059790220454 |
12 | 1a665580515b61 |
13 | 882147298445b |
14 | 378d065c6d385 |
15 | 1838bb41c5a01 |
hex | b6d1c0ea7539 |
201012001011001 has 8 divisors (see below), whose sum is σ = 211595915016000. Its totient is φ = 190428520506480.
The previous prime is 201012001010993. The next prime is 201012001011023. The reversal of 201012001011001 is 100110100210102.
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 201012001011001 - 23 = 201012001010993 is a prime.
It is a super-2 number, since 2×2010120010110012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201012001111001) 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, 107423101 + ... + 109278298.
It is an arithmetic number, because the mean of its divisors is an integer number (26449489377000).
Almost surely, 2201012001011001 is an apocalyptic number.
It is an amenable number.
201012001011001 is a deficient number, since it is larger than the sum of its proper divisors (10583914004999).
201012001011001 is a wasteful number, since it uses less digits than its factorization.
201012001011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216750239.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 201012001011001 its reverse (100110100210102), we get a palindrome (301122101221103).
The spelling of 201012001011001 in words is "two hundred one trillion, twelve billion, one million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •