Base | Representation |
---|---|
bin | 1011000111010011011101… |
… | …1011110111111011110111 |
3 | 1121021020020121122210202010 |
4 | 2301310313123313323313 |
5 | 3100203242133322444 |
6 | 41553501510215303 |
7 | 2400605524152054 |
oct | 261646733677367 |
9 | 47236217583663 |
10 | 12220112010999 |
11 | 399157a71a5a2 |
12 | 145440a954533 |
13 | 6a8475674189 |
14 | 303656bc202b |
15 | 162d16d892b9 |
hex | b1d376f7ef7 |
12220112010999 has 8 divisors (see below), whose sum is σ = 16293707805040. Its totient is φ = 8146628778816.
The previous prime is 12220112010979. The next prime is 12220112011001. The reversal of 12220112010999 is 99901021102221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12220112010999 - 29 = 12220112010487 is a prime.
It is a super-2 number, since 2×122201120109992 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220112010979) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27886822 + ... + 28321635.
It is an arithmetic number, because the mean of its divisors is an integer number (2036713475630).
Almost surely, 212220112010999 is an apocalyptic number.
12220112010999 is a deficient number, since it is larger than the sum of its proper divisors (4073595794041).
12220112010999 is an equidigital number, since it uses as much as digits as its factorization.
12220112010999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56280929.
The product of its (nonzero) digits is 11664, while the sum is 39.
The spelling of 12220112010999 in words is "twelve trillion, two hundred twenty billion, one hundred twelve million, ten thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •