Base | Representation |
---|---|
bin | 10000010011011000010… |
… | …010011010000111111101 |
3 | 10222002202001002221110200 |
4 | 100103120102122013331 |
5 | 121323403432414323 |
6 | 2214400141554113 |
7 | 143640402405453 |
oct | 20233022320775 |
9 | 3862661087420 |
10 | 1120320201213 |
11 | 3a2141601a14 |
12 | 161160b75939 |
13 | 81851904885 |
14 | 3c31c1009d3 |
15 | 1e21e8bb443 |
hex | 104d849a1fd |
1120320201213 has 12 divisors (see below), whose sum is σ = 1618262031360. Its totient is φ = 746870099976.
The previous prime is 1120320201197. The next prime is 1120320201239. The reversal of 1120320201213 is 3121020230211.
1120320201213 is a `hidden beast` number, since 1 + 120 + 320 + 201 + 21 + 3 = 666.
It is not a de Polignac number, because 1120320201213 - 24 = 1120320201197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120320208213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 94431 + ... + 1499852.
It is an arithmetic number, because the mean of its divisors is an integer number (134855169280).
Almost surely, 21120320201213 is an apocalyptic number.
It is an amenable number.
1120320201213 is a deficient number, since it is larger than the sum of its proper divisors (497941830147).
1120320201213 is a wasteful number, since it uses less digits than its factorization.
1120320201213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1672368 (or 1672365 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1120320201213 its reverse (3121020230211), we get a palindrome (4241340431424).
The spelling of 1120320201213 in words is "one trillion, one hundred twenty billion, three hundred twenty million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •