Base | Representation |
---|---|
bin | 10000010101111001010… |
… | …101011100110010010001 |
3 | 10222100201100021011102010 |
4 | 100111321111130302101 |
5 | 121344422131132241 |
6 | 2215524221413133 |
7 | 144064351415010 |
oct | 20257125346221 |
9 | 3870640234363 |
10 | 1123022130321 |
11 | 3a32a8796283 |
12 | 161795a0a1a9 |
13 | 81b926153b0 |
14 | 3c4d6cb6a77 |
15 | 1e32bbd2d16 |
hex | 1057955cc91 |
1123022130321 has 64 divisors (see below), whose sum is σ = 1951786077696. Its totient is φ = 557383680000.
The previous prime is 1123022130281. The next prime is 1123022130331. The reversal of 1123022130321 is 1230312203211.
It is not a de Polignac number, because 1123022130321 - 27 = 1123022130193 is a prime.
It is a super-2 number, since 2×11230221303212 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (1123022130331) 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 63 ways as a sum of consecutive naturals, for example, 20769321 + ... + 20823321.
It is an arithmetic number, because the mean of its divisors is an integer number (30496657464).
Almost surely, 21123022130321 is an apocalyptic number.
It is an amenable number.
1123022130321 is a deficient number, since it is larger than the sum of its proper divisors (828763947375).
1123022130321 is a wasteful number, since it uses less digits than its factorization.
1123022130321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58522.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1123022130321 its reverse (1230312203211), we get a palindrome (2353334333532).
The spelling of 1123022130321 in words is "one trillion, one hundred twenty-three billion, twenty-two million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •