Base | Representation |
---|---|
bin | 10001011110101000011… |
… | …100110100010010110100 |
3 | 11020211022020221201111210 |
4 | 101132220130310102310 |
5 | 124134344213031400 |
6 | 2315442101001420 |
7 | 152530631364126 |
oct | 21365034642264 |
9 | 4224266851453 |
10 | 1201122002100 |
11 | 423436069959 |
12 | 1749513b3270 |
13 | 8935aba0187 |
14 | 421c5553216 |
15 | 2139d46a950 |
hex | 117a87344b4 |
1201122002100 has 36 divisors (see below), whose sum is σ = 3475246326944. Its totient is φ = 320299200480.
The previous prime is 1201122002071. The next prime is 1201122002153. The reversal of 1201122002100 is 12002211021.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2001869704 + ... + 2001870303.
Almost surely, 21201122002100 is an apocalyptic number.
1201122002100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1201122002100 is an abundant number, since it is smaller than the sum of its proper divisors (2274124324844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201122002100 is a wasteful number, since it uses less digits than its factorization.
1201122002100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4003740024 (or 4003740017 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1201122002100 its reverse (12002211021), we get a palindrome (1213124213121).
It can be divided in two parts, 120112 and 2002100, that added together give a palindrome (2122212).
The spelling of 1201122002100 in words is "one trillion, two hundred one billion, one hundred twenty-two million, two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •