Base | Representation |
---|---|
bin | 10001011101100110001… |
… | …011010100111111110001 |
3 | 11020201102202202022122202 |
4 | 101131212023110333301 |
5 | 124130110042334301 |
6 | 2315135501312545 |
7 | 152461240505633 |
oct | 21354613247761 |
9 | 4221382668582 |
10 | 1200010121201 |
11 | 422a1547a321 |
12 | 1746a0b65755 |
13 | 8921171c798 |
14 | 4211ba00a53 |
15 | 21335a3966b |
hex | 117662d4ff1 |
1200010121201 has 4 divisors (see below), whose sum is σ = 1200012447600. Its totient is φ = 1200007794804.
The previous prime is 1200010121183. The next prime is 1200010121239. The reversal of 1200010121201 is 1021210100021.
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 1200010121201 - 214 = 1200010104817 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1200010121291) 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, 5171 + ... + 1549208.
It is an arithmetic number, because the mean of its divisors is an integer number (300003111900).
Almost surely, 21200010121201 is an apocalyptic number.
It is an amenable number.
1200010121201 is a deficient number, since it is larger than the sum of its proper divisors (2326399).
1200010121201 is an equidigital number, since it uses as much as digits as its factorization.
1200010121201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2326398.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1200010121201 its reverse (1021210100021), we get a palindrome (2221220221222).
The spelling of 1200010121201 in words is "one trillion, two hundred billion, ten million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •