Base | Representation |
---|---|
bin | 1011000110111101000111… |
… | …1000101100010010011111 |
3 | 1121020122202120001211121210 |
4 | 2301233101320230102133 |
5 | 3100104001002302033 |
6 | 41551030341355503 |
7 | 2400304054144215 |
oct | 261572170542237 |
9 | 47218676054553 |
10 | 12214113322143 |
11 | 3989a816048a7 |
12 | 1453215a08b93 |
13 | 6a7a2a947145 |
14 | 303248234cb5 |
15 | 162ab540ed63 |
hex | b1bd1e2c49f |
12214113322143 has 32 divisors (see below), whose sum is σ = 16855166361600. Its totient is φ = 7859300548320.
The previous prime is 12214113322091. The next prime is 12214113322193. The reversal of 12214113322143 is 34122331141221.
It is not a de Polignac number, because 12214113322143 - 212 = 12214113318047 is a prime.
It is a super-2 number, since 2×122141133221432 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12214113322143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12214113322193) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 111141180 + ... + 111251022.
It is an arithmetic number, because the mean of its divisors is an integer number (526723948800).
Almost surely, 212214113322143 is an apocalyptic number.
12214113322143 is a deficient number, since it is larger than the sum of its proper divisors (4641053039457).
12214113322143 is a wasteful number, since it uses less digits than its factorization.
12214113322143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113019.
The product of its digits is 6912, while the sum is 30.
Adding to 12214113322143 its reverse (34122331141221), we get a palindrome (46336444463364).
The spelling of 12214113322143 in words is "twelve trillion, two hundred fourteen billion, one hundred thirteen million, three hundred twenty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •