Base | Representation |
---|---|
bin | 11101000111000001010… |
… | …00000001110010001001 |
3 | 10112121200201122101120001 |
4 | 32203200220001302021 |
5 | 112341402424031441 |
6 | 2043252550403001 |
7 | 132155625146026 |
oct | 16434050016211 |
9 | 3477621571501 |
10 | 1000201002121 |
11 | 356201432852 |
12 | 141a19360461 |
13 | 7341ab13cc9 |
14 | 365a500a54d |
15 | 1b03e21c731 |
hex | e8e0a01c89 |
1000201002121 has 4 divisors (see below), whose sum is σ = 1006337204752. Its totient is φ = 994064799492.
The previous prime is 1000201002077. The next prime is 1000201002127. The reversal of 1000201002121 is 1212001020001.
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 not a de Polignac number, because 1000201002121 - 213 = 1000200993929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000201002098 and 1000201002107.
It is not an unprimeable number, because it can be changed into a prime (1000201002127) 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, 3068101071 + ... + 3068101396.
It is an arithmetic number, because the mean of its divisors is an integer number (251584301188).
Almost surely, 21000201002121 is an apocalyptic number.
It is an amenable number.
1000201002121 is a deficient number, since it is larger than the sum of its proper divisors (6136202631).
1000201002121 is an equidigital number, since it uses as much as digits as its factorization.
1000201002121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6136202630.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1000201002121 its reverse (1212001020001), we get a palindrome (2212202022122).
The spelling of 1000201002121 in words is "one trillion, two hundred one million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •