Base | Representation |
---|---|
bin | 1011000110111100101111… |
… | …1011001011110110111011 |
3 | 1121020122111120212211002211 |
4 | 2301233023323023312323 |
5 | 3100103244401444233 |
6 | 41551012410035551 |
7 | 2400301431111565 |
oct | 261571373136673 |
9 | 47218446784084 |
10 | 12214013312443 |
11 | 3989a30107058 |
12 | 14531a8418bb7 |
13 | 6a7a12ccc0c7 |
14 | 303238c40335 |
15 | 162aab7575cd |
hex | b1bcbecbdbb |
12214013312443 has 4 divisors (see below), whose sum is σ = 12473885936160. Its totient is φ = 11954140688728.
The previous prime is 12214013312419. The next prime is 12214013312539. The reversal of 12214013312443 is 34421331041221.
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 12214013312443 - 217 = 12214013181371 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12214013318443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 129936311788 + ... + 129936311881.
It is an arithmetic number, because the mean of its divisors is an integer number (3118471484040).
Almost surely, 212214013312443 is an apocalyptic number.
12214013312443 is a deficient number, since it is larger than the sum of its proper divisors (259872623717).
12214013312443 is an equidigital number, since it uses as much as digits as its factorization.
12214013312443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259872623716.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 12214013312443 its reverse (34421331041221), we get a palindrome (46635344353664).
The spelling of 12214013312443 in words is "twelve trillion, two hundred fourteen billion, thirteen million, three hundred twelve thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •