Base | Representation |
---|---|
bin | 10000010110000100100… |
… | …111001100010111000101 |
3 | 10222101012112021112222011 |
4 | 100112010213030113011 |
5 | 121400314100043023 |
6 | 2215555100534221 |
7 | 144102136533352 |
oct | 20260447142705 |
9 | 3871175245864 |
10 | 1123211331013 |
11 | 3a3395572592 |
12 | 161829251371 |
13 | 81bc288b075 |
14 | 3c514087629 |
15 | 1e33d60750d |
hex | 105849cc5c5 |
1123211331013 has 8 divisors (see below), whose sum is σ = 1134663865632. Its totient is φ = 1111776486096.
The previous prime is 1123211330993. The next prime is 1123211331029. The reversal of 1123211331013 is 3101331123211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1123211331013 - 25 = 1123211330981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123211335013) 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 7 ways as a sum of consecutive naturals, for example, 4294770 + ... + 4548787.
It is an arithmetic number, because the mean of its divisors is an integer number (141832983204).
Almost surely, 21123211331013 is an apocalyptic number.
It is an amenable number.
1123211331013 is a deficient number, since it is larger than the sum of its proper divisors (11452534619).
1123211331013 is a wasteful number, since it uses less digits than its factorization.
1123211331013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8844851.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 1123211331013 its reverse (3101331123211), we get a palindrome (4224542454224).
The spelling of 1123211331013 in words is "one trillion, one hundred twenty-three billion, two hundred eleven million, three hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •