Base | Representation |
---|---|
bin | 111000000001010100… |
… | …0010010101110111101 |
3 | 102111112010200211101000 |
4 | 1300002220102232331 |
5 | 3432340104414323 |
6 | 131133323040513 |
7 | 11456140223646 |
oct | 1600250225675 |
9 | 374463624330 |
10 | 120303201213 |
11 | 47025025738 |
12 | 1b395370139 |
13 | b462c66280 |
14 | 5b737106cd |
15 | 31e18e7e43 |
hex | 1c02a12bbd |
120303201213 has 64 divisors (see below), whose sum is σ = 199720442880. Its totient is φ = 71089933824.
The previous prime is 120303201211. The next prime is 120303201229. The reversal of 120303201213 is 312102303021.
It is not a de Polignac number, because 120303201213 - 21 = 120303201211 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120303201211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 805545 + ... + 943137.
It is an arithmetic number, because the mean of its divisors is an integer number (3120631920).
Almost surely, 2120303201213 is an apocalyptic number.
120303201213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
120303201213 is a deficient number, since it is larger than the sum of its proper divisors (79417241667).
120303201213 is a wasteful number, since it uses less digits than its factorization.
120303201213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137715 (or 137709 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 120303201213 its reverse (312102303021), we get a palindrome (432405504234).
The spelling of 120303201213 in words is "one hundred twenty billion, three hundred three million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •