Base | Representation |
---|---|
bin | 1011000000111010011110… |
… | …0000110111111010100101 |
3 | 1120212201212020200100211120 |
4 | 2300032213200313322211 |
5 | 3041403420221021013 |
6 | 41431223343324153 |
7 | 2356641045632505 |
oct | 260164740677245 |
9 | 46781766610746 |
10 | 12110323220133 |
11 | 3949a60818a96 |
12 | 143708a8b0659 |
13 | 69acc9b575b8 |
14 | 2dc1dda9ba05 |
15 | 16003d5b2123 |
hex | b03a7837ea5 |
12110323220133 has 8 divisors (see below), whose sum is σ = 16147124136000. Its totient is φ = 8073535558848.
The previous prime is 12110323220059. The next prime is 12110323220197. The reversal of 12110323220133 is 33102232301121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12110323220133 - 216 = 12110323154597 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12110323221133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 938548 + ... + 5010141.
It is an arithmetic number, because the mean of its divisors is an integer number (2018390517000).
Almost surely, 212110323220133 is an apocalyptic number.
It is an amenable number.
12110323220133 is a deficient number, since it is larger than the sum of its proper divisors (4036800915867).
12110323220133 is an equidigital number, since it uses as much as digits as its factorization.
12110323220133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6627291.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 12110323220133 its reverse (33102232301121), we get a palindrome (45212555521254).
The spelling of 12110323220133 in words is "twelve trillion, one hundred ten billion, three hundred twenty-three million, two hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •