Base | Representation |
---|---|
bin | 10000010011000111000… |
… | …111110001111001001001 |
3 | 10222001222222012002020202 |
4 | 100103013013301321021 |
5 | 121322311220433223 |
6 | 2214311413101545 |
7 | 143630304431513 |
oct | 20230707617111 |
9 | 3861888162222 |
10 | 1120032202313 |
11 | 3a2003a850a2 |
12 | 1610a06278b5 |
13 | 8180704941b |
14 | 3c2d1b72bb3 |
15 | 1e20447d428 |
hex | 104c71f1e49 |
1120032202313 has 16 divisors (see below), whose sum is σ = 1173360169296. Its totient is φ = 1068207759360.
The previous prime is 1120032202309. The next prime is 1120032202327. The reversal of 1120032202313 is 3132022300211.
It can be written as a sum of positive squares in 8 ways, for example, as 338174814784 + 781857387529 = 581528^2 + 884227^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120032202313 - 22 = 1120032202309 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1120032202363) 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 15 ways as a sum of consecutive naturals, for example, 1317620 + ... + 1994037.
It is an arithmetic number, because the mean of its divisors is an integer number (73335010581).
Almost surely, 21120032202313 is an apocalyptic number.
It is an amenable number.
1120032202313 is a deficient number, since it is larger than the sum of its proper divisors (53327966983).
1120032202313 is a wasteful number, since it uses less digits than its factorization.
1120032202313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3311884.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1120032202313 its reverse (3132022300211), we get a palindrome (4252054502524).
The spelling of 1120032202313 in words is "one trillion, one hundred twenty billion, thirty-two million, two hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •