Base | Representation |
---|---|
bin | 1011000000010100110000… |
… | …0111111011100011101001 |
3 | 1120211202201202002112011202 |
4 | 2300011030013323203221 |
5 | 3041222202201121301 |
6 | 41422431040133545 |
7 | 2356132144101206 |
oct | 260051407734351 |
9 | 46752652075152 |
10 | 12100200020201 |
11 | 3945736507057 |
12 | 14351246072b5 |
13 | 69a075792877 |
14 | 2db91d428cad |
15 | 15eb499ba66b |
hex | b014c1fb8e9 |
12100200020201 has 4 divisors (see below), whose sum is σ = 12395326850004. Its totient is φ = 11805073190400.
The previous prime is 12100200020147. The next prime is 12100200020213. The reversal of 12100200020201 is 10202000200121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1343269410025 + 10756930610176 = 1158995^2 + 3279776^2 .
It is not a de Polignac number, because 12100200020201 - 26 = 12100200020137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12100200020291) 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, 147563414840 + ... + 147563414921.
It is an arithmetic number, because the mean of its divisors is an integer number (3098831712501).
Almost surely, 212100200020201 is an apocalyptic number.
It is an amenable number.
12100200020201 is a deficient number, since it is larger than the sum of its proper divisors (295126829803).
12100200020201 is an equidigital number, since it uses as much as digits as its factorization.
12100200020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295126829802.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 12100200020201 its reverse (10202000200121), we get a palindrome (22302200220322).
The spelling of 12100200020201 in words is "twelve trillion, one hundred billion, two hundred million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •