Base | Representation |
---|---|
bin | 10000010011010010111… |
… | …110100100000100101001 |
3 | 10222002111211110210102021 |
4 | 100103102332210010221 |
5 | 121323213131104001 |
6 | 2214343240304441 |
7 | 143635241231200 |
oct | 20232276440451 |
9 | 3862454423367 |
10 | 1120231113001 |
11 | 3a20a62936a0 |
12 | 161137172121 |
13 | 81839311960 |
14 | 3c310350237 |
15 | 1e216b6eba1 |
hex | 104d2fa4129 |
1120231113001 has 96 divisors (see below), whose sum is σ = 1585652302080. Its totient is φ = 777034944000.
The previous prime is 1120231112999. The next prime is 1120231113061. The reversal of 1120231113001 is 1003111320211.
It is a happy number.
It is not a de Polignac number, because 1120231113001 - 21 = 1120231112999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1120231113061) 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 95 ways as a sum of consecutive naturals, for example, 196494451 + ... + 196500151.
It is an arithmetic number, because the mean of its divisors is an integer number (16517211480).
Almost surely, 21120231113001 is an apocalyptic number.
1120231113001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1120231113001 is a deficient number, since it is larger than the sum of its proper divisors (465421189079).
1120231113001 is a wasteful number, since it uses less digits than its factorization.
1120231113001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6735 (or 6728 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1120231113001 its reverse (1003111320211), we get a palindrome (2123342433212).
The spelling of 1120231113001 in words is "one trillion, one hundred twenty billion, two hundred thirty-one million, one hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •