Base | Representation |
---|---|
bin | 11101001000100000111… |
… | …00010010001110101001 |
3 | 10112200202122011210111012 |
4 | 32210100130102032221 |
5 | 112400023311330441 |
6 | 2043504325113305 |
7 | 132214536032126 |
oct | 16442034221651 |
9 | 3480678153435 |
10 | 1001003230121 |
11 | 3565832555a4 |
12 | 142001b58835 |
13 | 7351809702b |
14 | 3663d79574d |
15 | 1b0898849eb |
hex | e9107123a9 |
1001003230121 has 2 divisors, whose sum is σ = 1001003230122. Its totient is φ = 1001003230120.
The previous prime is 1001003230103. The next prime is 1001003230151. The reversal of 1001003230121 is 1210323001001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 999910002025 + 1093228096 = 999955^2 + 33064^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001003230121 - 226 = 1000936121257 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1001003230096 and 1001003230105.
It is not a weakly prime, because it can be changed into another prime (1001003230151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500501615060 + 500501615061.
It is an arithmetic number, because the mean of its divisors is an integer number (500501615061).
Almost surely, 21001003230121 is an apocalyptic number.
It is an amenable number.
1001003230121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001003230121 is an equidigital number, since it uses as much as digits as its factorization.
1001003230121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1001003230121 its reverse (1210323001001), we get a palindrome (2211326231122).
The spelling of 1001003230121 in words is "one trillion, one billion, three million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •