Base | Representation |
---|---|
bin | 1010111011101011000111… |
… | …1001110010101100100101 |
3 | 1120120010111121011002202101 |
4 | 2232322301321302230211 |
5 | 3033420040110230201 |
6 | 41322015010212101 |
7 | 2350303214322250 |
oct | 256726171625445 |
9 | 46503447132671 |
10 | 12020303211301 |
11 | 3914866880a80 |
12 | 1421747284031 |
13 | 692681b4ab98 |
14 | 2d7b00272097 |
15 | 15ca205d1d01 |
hex | aeeb1e72b25 |
12020303211301 has 16 divisors (see below), whose sum is σ = 14987364226560. Its totient is φ = 9365837428080.
The previous prime is 12020303211289. The next prime is 12020303211337. The reversal of 12020303211301 is 10311230302021.
It is not a de Polignac number, because 12020303211301 - 29 = 12020303210789 is a prime.
It is a super-2 number, since 2×120203032113012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12020303211361) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4122631 + ... + 6405988.
It is an arithmetic number, because the mean of its divisors is an integer number (936710264160).
Almost surely, 212020303211301 is an apocalyptic number.
12020303211301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12020303211301 is a deficient number, since it is larger than the sum of its proper divisors (2967061015259).
12020303211301 is a wasteful number, since it uses less digits than its factorization.
12020303211301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10543464.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 12020303211301 its reverse (10311230302021), we get a palindrome (22331533513322).
The spelling of 12020303211301 in words is "twelve trillion, twenty billion, three hundred three million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.207 sec. • engine limits •