Base | Representation |
---|---|
bin | 10001011101100101101… |
… | …000100100111000000001 |
3 | 11020201102010121111002100 |
4 | 101131211220210320001 |
5 | 124130100224324301 |
6 | 2315134534141013 |
7 | 152461100204106 |
oct | 21354550447001 |
9 | 4221363544070 |
10 | 1200001011201 |
11 | 422a103178a3 |
12 | 174699ab1769 |
13 | 8920c880055 |
14 | 4211a70caad |
15 | 21334d3a286 |
hex | 11765a24e01 |
1200001011201 has 12 divisors (see below), whose sum is σ = 1749236949460. Its totient is φ = 792661217760.
The previous prime is 1200001011191. The next prime is 1200001011229. The reversal of 1200001011201 is 1021101000021.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 906427764225 + 293573246976 = 952065^2 + 541824^2 .
It is not a de Polignac number, because 1200001011201 - 217 = 1200000880129 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 not an unprimeable number, because it can be changed into a prime (1200001011101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 611620330 + ... + 611622291.
Almost surely, 21200001011201 is an apocalyptic number.
It is an amenable number.
1200001011201 is a deficient number, since it is larger than the sum of its proper divisors (549235938259).
1200001011201 is a wasteful number, since it uses less digits than its factorization.
1200001011201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1223242736 (or 1223242733 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1200001011201 its reverse (1021101000021), we get a palindrome (2221102011222).
The spelling of 1200001011201 in words is "one trillion, two hundred billion, one million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •