Base | Representation |
---|---|
bin | 111000010110000111… |
… | …0100110100111111011 |
3 | 102120022202221021021000 |
4 | 1300230032212213323 |
5 | 3440302241010021 |
6 | 131330453420043 |
7 | 11512343315325 |
oct | 1605416464773 |
9 | 376282837230 |
10 | 121001110011 |
11 | 47352a76971 |
12 | 1b54b03a623 |
13 | b544722862 |
14 | 5bdc2a2615 |
15 | 3232d05b26 |
hex | 1c2c3a69fb |
121001110011 has 8 divisors (see below), whose sum is σ = 179260903760. Its totient is φ = 80667406656.
The previous prime is 121001110007. The next prime is 121001110019. The reversal of 121001110011 is 110011100121.
It is not a de Polignac number, because 121001110011 - 22 = 121001110007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121001109975 and 121001110002.
It is not an unprimeable number, because it can be changed into a prime (121001110019) 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, 2240761270 + ... + 2240761323.
It is an arithmetic number, because the mean of its divisors is an integer number (22407612970).
Almost surely, 2121001110011 is an apocalyptic number.
121001110011 is a deficient number, since it is larger than the sum of its proper divisors (58259793749).
121001110011 is an equidigital number, since it uses as much as digits as its factorization.
121001110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4481522602 (or 4481522596 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 121001110011 its reverse (110011100121), we get a palindrome (231012210132).
It can be divided in two parts, 1 and 21001110011, that added together give a palindrome (21001110012).
The spelling of 121001110011 in words is "one hundred twenty-one billion, one million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •