Base | Representation |
---|---|
bin | 101101011110011001011101… |
… | …111000001000011000001001 |
3 | 222020010220121002220011120001 |
4 | 231132121131320020120021 |
5 | 202203304043124213001 |
6 | 1545211111240403001 |
7 | 60061411526115022 |
oct | 5536313570103011 |
9 | 866126532804501 |
10 | 200001022101001 |
11 | 587a9a58a61a20 |
12 | 1a521655776461 |
13 | 877a027c66884 |
14 | 375615b685c49 |
15 | 181c743b89001 |
hex | b5e65de08609 |
200001022101001 has 8 divisors (see below), whose sum is σ = 227669147688384. Its totient is φ = 173913932261520.
The previous prime is 200001022100981. The next prime is 200001022101053. The reversal of 200001022101001 is 100101220100002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-200001022101001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200001022101061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 395258936706 + ... + 395258937211.
It is an arithmetic number, because the mean of its divisors is an integer number (28458643461048).
Almost surely, 2200001022101001 is an apocalyptic number.
It is an amenable number.
200001022101001 is a deficient number, since it is larger than the sum of its proper divisors (27668125587383).
200001022101001 is a wasteful number, since it uses less digits than its factorization.
200001022101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 790517873951.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 200001022101001 its reverse (100101220100002), we get a palindrome (300102242201003).
The spelling of 200001022101001 in words is "two hundred trillion, one billion, twenty-two million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •