Base | Representation |
---|---|
bin | 11011100000110010001110… |
… | …000100001010111100110010 |
3 | 120212102111200010112021022211 |
4 | 123200302032010022330302 |
5 | 111324431403220333020 |
6 | 1105202420411322334 |
7 | 34325655544013242 |
oct | 3340621604127462 |
9 | 525374603467284 |
10 | 121000202121010 |
11 | 356109966a0663 |
12 | 116a2796a503aa |
13 | 5269368543034 |
14 | 21c462628bb22 |
15 | dec75d9e485a |
hex | 6e0c8e10af32 |
121000202121010 has 8 divisors (see below), whose sum is σ = 217800363817836. Its totient is φ = 48400080848400.
The previous prime is 121000202120999. The next prime is 121000202121017. The reversal of 121000202121010 is 10121202000121.
It can be written as a sum of positive squares in 2 ways, for example, as 120579220454449 + 420981666561 = 10980857^2 + 648831^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1210002021210103 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (121000202121017) 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, 6050010106041 + ... + 6050010106060.
Almost surely, 2121000202121010 is an apocalyptic number.
121000202121010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121000202121010 is a deficient number, since it is larger than the sum of its proper divisors (96800161696826).
121000202121010 is a wasteful number, since it uses less digits than its factorization.
121000202121010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12100020212108.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121000202121010 its reverse (10121202000121), we get a palindrome (131121404121131).
The spelling of 121000202121010 in words is "one hundred twenty-one trillion, two hundred two million, one hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •