Base | Representation |
---|---|
bin | 11011100010001111010110… |
… | …011110000010100111110001 |
3 | 120212210001210020021020201202 |
4 | 123202033112132002213301 |
5 | 111333101202441010001 |
6 | 1105320355300540545 |
7 | 34336125606261221 |
oct | 3342172636024761 |
9 | 525701706236652 |
10 | 121100201110001 |
11 | 3564a3414a6113 |
12 | 116ba0443b1755 |
13 | 5275913a8a539 |
14 | 21c93d1128081 |
15 | e00162ace96b |
hex | 6e23d67829f1 |
121100201110001 has 4 divisors (see below), whose sum is σ = 121359516316272. Its totient is φ = 120840885903732.
The previous prime is 121100201109977. The next prime is 121100201110153. The reversal of 121100201110001 is 100011102001121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 121100201110001 - 226 = 121100134001137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121100201110901) 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, 129657602435 + ... + 129657603368.
It is an arithmetic number, because the mean of its divisors is an integer number (30339879079068).
Almost surely, 2121100201110001 is an apocalyptic number.
It is an amenable number.
121100201110001 is a deficient number, since it is larger than the sum of its proper divisors (259315206271).
121100201110001 is an equidigital number, since it uses as much as digits as its factorization.
121100201110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259315206270.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 121100201110001 its reverse (100011102001121), we get a palindrome (221111303111122).
The spelling of 121100201110001 in words is "one hundred twenty-one trillion, one hundred billion, two hundred one million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •