Base | Representation |
---|---|
bin | 10011001100100101111011… |
… | …10000111111100011011111 |
3 | 12112110122000202200211210020 |
4 | 21212102331300333203133 |
5 | 21013114010303302033 |
6 | 225440522225443223 |
7 | 11614604206206462 |
oct | 1146227560774337 |
9 | 175418022624706 |
10 | 42214122322143 |
11 | 124a59aa592772 |
12 | 48994681a0513 |
13 | 1a72a0bbb7a25 |
14 | a5d2628852d9 |
15 | 4d3145db56b3 |
hex | 2664bdc3f8df |
42214122322143 has 8 divisors (see below), whose sum is σ = 56427273500208. Its totient is φ = 28071859679424.
The previous prime is 42214122322133. The next prime is 42214122322147. The reversal of 42214122322143 is 34122322141224.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 42214122322143 - 218 = 42214122059999 is a prime.
It is a super-2 number, since 2×422141223221432 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42214122322147) 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, 17722132446 + ... + 17722134827.
It is an arithmetic number, because the mean of its divisors is an integer number (7053409187526).
Almost surely, 242214122322143 is an apocalyptic number.
42214122322143 is a deficient number, since it is larger than the sum of its proper divisors (14213151178065).
42214122322143 is a wasteful number, since it uses less digits than its factorization.
42214122322143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35444267673.
The product of its digits is 36864, while the sum is 33.
Adding to 42214122322143 its reverse (34122322141224), we get a palindrome (76336444463367).
The spelling of 42214122322143 in words is "forty-two trillion, two hundred fourteen billion, one hundred twenty-two million, three hundred twenty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •