Base | Representation |
---|---|
bin | 1011000111010011100010… |
… | …0000111000111011110111 |
3 | 1121021020021212200222100101 |
4 | 2301310320200320323313 |
5 | 3100203311301244111 |
6 | 41553503354054531 |
7 | 2400606134013364 |
oct | 261647040707367 |
9 | 47236255628311 |
10 | 12220130103031 |
11 | 3991589957394 |
12 | 1454414a1a447 |
13 | 6a847933a016 |
14 | 30365937146b |
15 | 162d1875ebc1 |
hex | b1d38838ef7 |
12220130103031 has 8 divisors (see below), whose sum is σ = 12315156361200. Its totient is φ = 12125130251520.
The previous prime is 12220130103023. The next prime is 12220130103037. The reversal of 12220130103031 is 13030103102221.
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 12220130103031 - 23 = 12220130103023 is a prime.
It is a super-2 number, since 2×122201301030312 (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 (12220130103037) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5672026 + ... + 7524103.
It is an arithmetic number, because the mean of its divisors is an integer number (1539394545150).
Almost surely, 212220130103031 is an apocalyptic number.
12220130103031 is a deficient number, since it is larger than the sum of its proper divisors (95026258169).
12220130103031 is a wasteful number, since it uses less digits than its factorization.
12220130103031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13203329.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 12220130103031 its reverse (13030103102221), we get a palindrome (25250233205252).
The spelling of 12220130103031 in words is "twelve trillion, two hundred twenty billion, one hundred thirty million, one hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •