Base | Representation |
---|---|
bin | 11011010101001001111001… |
… | …111010000100100110101011 |
3 | 120202121002210100202121021212 |
4 | 123111021321322010212223 |
5 | 111223333122000342303 |
6 | 1103351324352423335 |
7 | 34214143556122505 |
oct | 3325117172044653 |
9 | 522532710677255 |
10 | 120201000012203 |
11 | 35332a59967380 |
12 | 11593913847b4b |
13 | 520bba098b736 |
14 | 2197a8bca2d75 |
15 | dd6a857aead8 |
hex | 6d5279e849ab |
120201000012203 has 4 divisors (see below), whose sum is σ = 131128363649688. Its totient is φ = 109273636374720.
The previous prime is 120201000012187. The next prime is 120201000012209. The reversal of 120201000012203 is 302210000102021.
It is a happy number.
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 120201000012203 - 24 = 120201000012187 is a prime.
It is a super-2 number, since 2×1202010000122032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120201000012209) 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, 5463681818726 + ... + 5463681818747.
It is an arithmetic number, because the mean of its divisors is an integer number (32782090912422).
Almost surely, 2120201000012203 is an apocalyptic number.
120201000012203 is a deficient number, since it is larger than the sum of its proper divisors (10927363637485).
120201000012203 is a wasteful number, since it uses less digits than its factorization.
120201000012203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10927363637484.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 120201000012203 its reverse (302210000102021), we get a palindrome (422411000114224).
The spelling of 120201000012203 in words is "one hundred twenty trillion, two hundred one billion, twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •