Base | Representation |
---|---|
bin | 1011000111011111010110… |
… | …0010011100000110100011 |
3 | 1121021112110220001201010101 |
4 | 2301313311202130012203 |
5 | 3100231310124344133 |
6 | 41555150202043231 |
7 | 2401050542431123 |
oct | 261676542340643 |
9 | 47245426051111 |
10 | 12223301403043 |
11 | 3992966a87a95 |
12 | 1454b5aaa9517 |
13 | 6a886336a4c3 |
14 | 30387a608c83 |
15 | 162e51d8e37d |
hex | b1df589c1a3 |
12223301403043 has 4 divisors (see below), whose sum is σ = 12291588003240. Its totient is φ = 12155014802848.
The previous prime is 12223301403037. The next prime is 12223301403121. The reversal of 12223301403043 is 34030410332221.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12223301403043 - 25 = 12223301403011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12223301404043) 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 3 ways as a sum of consecutive naturals, for example, 34143299830 + ... + 34143300187.
It is an arithmetic number, because the mean of its divisors is an integer number (3072897000810).
Almost surely, 212223301403043 is an apocalyptic number.
12223301403043 is a deficient number, since it is larger than the sum of its proper divisors (68286600197).
12223301403043 is an equidigital number, since it uses as much as digits as its factorization.
12223301403043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68286600196.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 12223301403043 its reverse (34030410332221), we get a palindrome (46253711735264).
The spelling of 12223301403043 in words is "twelve trillion, two hundred twenty-three billion, three hundred one million, four hundred three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •