Base | Representation |
---|---|
bin | 11011100000110011001001… |
… | …101010011111001010001010 |
3 | 120212102121020211000110020212 |
4 | 123200303021222133022022 |
5 | 111324440430204133002 |
6 | 1105203103530521122 |
7 | 34326022405016462 |
oct | 3340631152371212 |
9 | 525377224013225 |
10 | 121001202021002 |
11 | 3561135a056296 |
12 | 116a2a158961a2 |
13 | 5269497746834 |
14 | 21c46bcdb0ba2 |
15 | dec7bb6a6352 |
hex | 6e0cc9a9f28a |
121001202021002 has 4 divisors (see below), whose sum is σ = 181501803031506. Its totient is φ = 60500601010500.
The previous prime is 121001202021001. The next prime is 121001202021019. The reversal of 121001202021002 is 200120202100121.
121001202021002 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 66862200578761 + 54139001442241 = 8176931^2 + 7357921^2 .
It is not an unprimeable number, because it can be changed into a prime (121001202021001) 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 as a sum of consecutive naturals, namely, 30250300505249 + ... + 30250300505252.
Almost surely, 2121001202021002 is an apocalyptic number.
121001202021002 is a deficient number, since it is larger than the sum of its proper divisors (60500601010504).
121001202021002 is an equidigital number, since it uses as much as digits as its factorization.
121001202021002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60500601010503.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 121001202021002 its reverse (200120202100121), we get a palindrome (321121404121123).
The spelling of 121001202021002 in words is "one hundred twenty-one trillion, one billion, two hundred two million, twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •