Base | Representation |
---|---|
bin | 11011100010011001100001… |
… | …010010011000011000001011 |
3 | 120212211002222012010101202221 |
4 | 123202121201102120120023 |
5 | 111333241033211133003 |
6 | 1105325402551034511 |
7 | 34336663312424050 |
oct | 3342314122303013 |
9 | 525732865111687 |
10 | 121111120021003 |
11 | 35653a34989602 |
12 | 1170019106ba37 |
13 | 5276963c62c18 |
14 | 21c9b4932b027 |
15 | e005a14a27bd |
hex | 6e266149860b |
121111120021003 has 8 divisors (see below), whose sum is σ = 138413628004608. Its totient is φ = 103808841889704.
The previous prime is 121111120020949. The next prime is 121111120021007. The reversal of 121111120021003 is 300120021111121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121111120021003 - 217 = 121111119889931 is a prime.
It is a super-2 number, since 2×1211111200210032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121111120021007) 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, 56332501 + ... + 58442902.
It is an arithmetic number, because the mean of its divisors is an integer number (17301703500576).
Almost surely, 2121111120021003 is an apocalyptic number.
121111120021003 is a deficient number, since it is larger than the sum of its proper divisors (17302507983605).
121111120021003 is a wasteful number, since it uses less digits than its factorization.
121111120021003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114926153.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 121111120021003 its reverse (300120021111121), we get a palindrome (421231141132124).
The spelling of 121111120021003 in words is "one hundred twenty-one trillion, one hundred eleven billion, one hundred twenty million, twenty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •