Base | Representation |
---|---|
bin | 11011100010011001100110… |
… | …000111110000001011101010 |
3 | 120212211010011211201201001121 |
4 | 123202121212013300023222 |
5 | 111333241214441333002 |
6 | 1105325415005205454 |
7 | 34336665315651151 |
oct | 3342314607601352 |
9 | 525733154651047 |
10 | 121111201121002 |
11 | 35653a767411a4 |
12 | 117001b426088a |
13 | 52769779b9ba1 |
14 | 21c9b55ddc598 |
15 | e005a8672237 |
hex | 6e26661f02ea |
121111201121002 has 8 divisors (see below), whose sum is σ = 182390573800512. Its totient is φ = 60314343187500.
The previous prime is 121111201120963. The next prime is 121111201121003. The reversal of 121111201121002 is 200121102111121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1211112011210022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121111201121003) 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 in 3 ways as a sum of consecutive naturals, for example, 120628685874 + ... + 120628686877.
It is an arithmetic number, because the mean of its divisors is an integer number (22798821725064).
Almost surely, 2121111201121002 is an apocalyptic number.
121111201121002 is a deficient number, since it is larger than the sum of its proper divisors (61279372679510).
121111201121002 is a wasteful number, since it uses less digits than its factorization.
121111201121002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241257373004.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 121111201121002 its reverse (200121102111121), we get a palindrome (321232303232123).
The spelling of 121111201121002 in words is "one hundred twenty-one trillion, one hundred eleven billion, two hundred one million, one hundred twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •