Base | Representation |
---|---|
bin | 1010111100010011110010… |
… | …1110000011010001111001 |
3 | 1120121011200112222011201202 |
4 | 2233010330232003101321 |
5 | 3034104420324213423 |
6 | 41331022300023545 |
7 | 2351140620336245 |
oct | 257047456032171 |
9 | 46534615864652 |
10 | 12031222101113 |
11 | 391945a24a556 |
12 | 1423893b31bb5 |
13 | 693702016a27 |
14 | 2d845846b425 |
15 | 15ce5de9d728 |
hex | af13cb83479 |
12031222101113 has 8 divisors (see below), whose sum is σ = 12237187946880. Its totient is φ = 11826598052880.
The previous prime is 12031222101103. The next prime is 12031222101121. The reversal of 12031222101113 is 31110122213021.
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 12031222101113 - 214 = 12031222084729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12031222101103) 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, 335431298 + ... + 335467163.
It is an arithmetic number, because the mean of its divisors is an integer number (1529648493360).
Almost surely, 212031222101113 is an apocalyptic number.
It is an amenable number.
12031222101113 is a deficient number, since it is larger than the sum of its proper divisors (205965845767).
12031222101113 is an equidigital number, since it uses as much as digits as its factorization.
12031222101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670898767.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 12031222101113 its reverse (31110122213021), we get a palindrome (43141344314134).
The spelling of 12031222101113 in words is "twelve trillion, thirty-one billion, two hundred twenty-two million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •