Base | Representation |
---|---|
bin | 10010111011110110110… |
… | …100010001001000101011 |
3 | 11121101200022220201001122 |
4 | 102323312310101020223 |
5 | 132304400040121303 |
6 | 2433434522205455 |
7 | 163003320115136 |
oct | 22736664211053 |
9 | 4541608821048 |
10 | 1301221020203 |
11 | 4619323857a5 |
12 | 19022835388b |
13 | 9592106b4c0 |
14 | 46d9d7cb21d |
15 | 23cab213e38 |
hex | 12ef6d1122b |
1301221020203 has 4 divisors (see below), whose sum is σ = 1401314944848. Its totient is φ = 1201127095560.
The previous prime is 1301221020193. The next prime is 1301221020301. The reversal of 1301221020203 is 3020201221031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1301221020203 - 218 = 1301220758059 is a prime.
It is a super-2 number, since 2×13012210202032 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1301221028203) 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, 50046962303 + ... + 50046962328.
It is an arithmetic number, because the mean of its divisors is an integer number (350328736212).
Almost surely, 21301221020203 is an apocalyptic number.
1301221020203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1301221020203 is a deficient number, since it is larger than the sum of its proper divisors (100093924645).
1301221020203 is a wasteful number, since it uses less digits than its factorization.
1301221020203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100093924644.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 1301221020203 its reverse (3020201221031), we get a palindrome (4321422241234).
The spelling of 1301221020203 in words is "one trillion, three hundred one billion, two hundred twenty-one million, twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •