Base | Representation |
---|---|
bin | 1011000111011110101000… |
… | …1100100010100100110101 |
3 | 1121021111222121222222021111 |
4 | 2301313222030202210311 |
5 | 3100230412421104023 |
6 | 41555115243315021 |
7 | 2401043042124523 |
oct | 261675214424465 |
9 | 47244877888244 |
10 | 12223111113013 |
11 | 39928796272a9 |
12 | 1454b0721ba71 |
13 | 6a8832b02a58 |
14 | 30385d233313 |
15 | 162e4030200d |
hex | b1dea322935 |
12223111113013 has 16 divisors (see below), whose sum is σ = 13190380136640. Its totient is φ = 11288671056000.
The previous prime is 12223111112959. The next prime is 12223111113019. The reversal of 12223111113013 is 31031111132221.
12223111113013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12223111113013 - 213 = 12223111104821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12223111113019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5016795 + ... + 7043752.
It is an arithmetic number, because the mean of its divisors is an integer number (824398758540).
Almost surely, 212223111113013 is an apocalyptic number.
It is an amenable number.
12223111113013 is a deficient number, since it is larger than the sum of its proper divisors (967269023627).
12223111113013 is a wasteful number, since it uses less digits than its factorization.
12223111113013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12061908.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 12223111113013 its reverse (31031111132221), we get a palindrome (43254222245234).
The spelling of 12223111113013 in words is "twelve trillion, two hundred twenty-three billion, one hundred eleven million, one hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •