Base | Representation |
---|---|
bin | 1011000001000101010011… |
… | …1001110000001000001001 |
3 | 1120220000100222102212022002 |
4 | 2300101110321300020021 |
5 | 3041430344420401301 |
6 | 41432424141040345 |
7 | 2360103120564116 |
oct | 260212471601011 |
9 | 46800328385262 |
10 | 12113232200201 |
11 | 3950213870850 |
12 | 1437760b560b5 |
13 | 69b371720892 |
14 | 2dc3d816d90d |
15 | 16015db7716b |
hex | b0454e70209 |
12113232200201 has 8 divisors (see below), whose sum is σ = 13214828618784. Its totient is φ = 11011701363520.
The previous prime is 12113232200197. The next prime is 12113232200239. The reversal of 12113232200201 is 10200223231121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12113232200201 - 22 = 12113232200197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12113232200281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16008875 + ... + 16748448.
It is an arithmetic number, because the mean of its divisors is an integer number (1651853577348).
Almost surely, 212113232200201 is an apocalyptic number.
12113232200201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12113232200201 is a deficient number, since it is larger than the sum of its proper divisors (1101596418583).
12113232200201 is a wasteful number, since it uses less digits than its factorization.
12113232200201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32790951.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 12113232200201 its reverse (10200223231121), we get a palindrome (22313455431322).
The spelling of 12113232200201 in words is "twelve trillion, one hundred thirteen billion, two hundred thirty-two million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •