Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …01110101111111100101 |
3 | 10112121011210200101201020 |
4 | 32203110231311333211 |
5 | 112341000301400401 |
6 | 2043221052121353 |
7 | 132150650644611 |
oct | 16432455657745 |
9 | 3477153611636 |
10 | 1000001200101 |
11 | 356109675612 |
12 | 141982466259 |
13 | 733b85c8b67 |
14 | 3658667a341 |
15 | 1b02b901d36 |
hex | e8d4b75fe5 |
1000001200101 has 4 divisors (see below), whose sum is σ = 1333334933472. Its totient is φ = 666667466732.
The previous prime is 1000001200067. The next prime is 1000001200111. The reversal of 1000001200101 is 1010021000001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000001200101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1000001200101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000001200111) 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, 166666866681 + ... + 166666866686.
It is an arithmetic number, because the mean of its divisors is an integer number (333333733368).
Almost surely, 21000001200101 is an apocalyptic number.
It is an amenable number.
1000001200101 is a deficient number, since it is larger than the sum of its proper divisors (333333733371).
1000001200101 is an equidigital number, since it uses as much as digits as its factorization.
1000001200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333333733370.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 1000001200101 its reverse (1010021000001), we get a palindrome (2010022200102).
The spelling of 1000001200101 in words is "one trillion, one million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •