Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …01111010111000011001 |
3 | 10112121011210201102011201 |
4 | 32203110231322320121 |
5 | 112341000303020441 |
6 | 2043221052354201 |
7 | 132150651060151 |
oct | 16432455727031 |
9 | 3477153642151 |
10 | 1000001220121 |
11 | 356109689662 |
12 | 141982475961 |
13 | 733b8604cc7 |
14 | 36586683761 |
15 | 1b02b907c31 |
hex | e8d4b7ae19 |
1000001220121 has 4 divisors (see below), whose sum is σ = 1002786739200. Its totient is φ = 997215701044.
The previous prime is 1000001220107. The next prime is 1000001220131. The reversal of 1000001220121 is 1210221000001.
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 1000001220121 - 25 = 1000001220089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000001220098 and 1000001220107.
It is not an unprimeable number, because it can be changed into a prime (1000001220131) 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, 1392759001 + ... + 1392759718.
It is an arithmetic number, because the mean of its divisors is an integer number (250696684800).
Almost surely, 21000001220121 is an apocalyptic number.
It is an amenable number.
1000001220121 is a deficient number, since it is larger than the sum of its proper divisors (2785519079).
1000001220121 is an equidigital number, since it uses as much as digits as its factorization.
1000001220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2785519078.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1000001220121 its reverse (1210221000001), we get a palindrome (2210222220122).
The spelling of 1000001220121 in words is "one trillion, one million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •