Base | Representation |
---|---|
bin | 11011100000111011010111… |
… | …010001001010111010111001 |
3 | 120212110110000100222100220111 |
4 | 123200323113101022322321 |
5 | 111330112010132400441 |
6 | 1105211122535024321 |
7 | 34326454052216503 |
oct | 3340732721127271 |
9 | 525413010870814 |
10 | 121010020200121 |
11 | 35615074750828 |
12 | 116a4676b0b0a1 |
13 | 526a2716361c0 |
14 | 21c4cb81b6d73 |
15 | decb3591a081 |
hex | 6e0ed744aeb9 |
121010020200121 has 8 divisors (see below), whose sum is σ = 130319806856960. Its totient is φ = 111700422623952.
The previous prime is 121010020200067. The next prime is 121010020200131. The reversal of 121010020200121 is 121002020010121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121010020200121 - 27 = 121010020199993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121010020200131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45939561 + ... + 48502198.
It is an arithmetic number, because the mean of its divisors is an integer number (16289975857120).
Almost surely, 2121010020200121 is an apocalyptic number.
It is an amenable number.
121010020200121 is a deficient number, since it is larger than the sum of its proper divisors (9309786656839).
121010020200121 is an equidigital number, since it uses as much as digits as its factorization.
121010020200121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94540335.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121010020200121 its reverse (121002020010121), we get a palindrome (242012040210242).
The spelling of 121010020200121 in words is "one hundred twenty-one trillion, ten billion, twenty million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •