Base | Representation |
---|---|
bin | 10001011101101011100… |
… | …110000010101010110101 |
3 | 11020201200002202221210022 |
4 | 101131223212002222311 |
5 | 124130301324310401 |
6 | 2315152505334525 |
7 | 152463423163100 |
oct | 21355346025265 |
9 | 4221602687708 |
10 | 1200101010101 |
11 | 422a61808514 |
12 | 174707497445 |
13 | 892274c31b6 |
14 | 42129add737 |
15 | 2133d9de71b |
hex | 1176b982ab5 |
1200101010101 has 48 divisors (see below), whose sum is σ = 1466279418240. Its totient is φ = 977497234560.
The previous prime is 1200101010089. The next prime is 1200101010113. The reversal of 1200101010101 is 1010101010021.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1200101010089) and next prime (1200101010113).
It is not a de Polignac number, because 1200101010101 - 210 = 1200101009077 is a prime.
1200101010101 is a modest number, since divided by 1010101 gives 12001 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200101010161) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 250697630 + ... + 250702416.
It is an arithmetic number, because the mean of its divisors is an integer number (30547487880).
Almost surely, 21200101010101 is an apocalyptic number.
It is an amenable number.
1200101010101 is a deficient number, since it is larger than the sum of its proper divisors (266178408139).
1200101010101 is a wasteful number, since it uses less digits than its factorization.
1200101010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6234 (or 6227 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1200101010101 its reverse (1010101010021), we get a palindrome (2210202020122).
The spelling of 1200101010101 in words is "one trillion, two hundred billion, one hundred one million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •