Base | Representation |
---|---|
bin | 10001011110100111001… |
… | …000111101100110011001 |
3 | 11020211020201120220220102 |
4 | 101132213020331212121 |
5 | 124134323101120441 |
6 | 2315435553505145 |
7 | 152530243501541 |
oct | 21364710754631 |
9 | 4224221526812 |
10 | 1201100020121 |
11 | 423424715531 |
12 | 174945b721b5 |
13 | 893564748a1 |
14 | 421c2670321 |
15 | 2139b57769b |
hex | 117a723d999 |
1201100020121 has 4 divisors (see below), whose sum is σ = 1209741027600. Its totient is φ = 1192459012644.
The previous prime is 1201100020031. The next prime is 1201100020123. The reversal of 1201100020121 is 1210200011021.
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 1201100020121 - 222 = 1201095825817 is a prime.
It is a super-3 number, since 3×12011000201213 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1201100020123) 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, 4320503531 + ... + 4320503808.
It is an arithmetic number, because the mean of its divisors is an integer number (302435256900).
Almost surely, 21201100020121 is an apocalyptic number.
It is an amenable number.
1201100020121 is a deficient number, since it is larger than the sum of its proper divisors (8641007479).
1201100020121 is an equidigital number, since it uses as much as digits as its factorization.
1201100020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8641007478.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1201100020121 its reverse (1210200011021), we get a palindrome (2411300031142).
The spelling of 1201100020121 in words is "one trillion, two hundred one billion, one hundred million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •