Base | Representation |
---|---|
bin | 1011111111101000101… |
… | …01001111101101110110 |
3 | 1110101202102120012201210 |
4 | 11333310111033231312 |
5 | 23223011000300342 |
6 | 513154213302250 |
7 | 41526513402243 |
oct | 5776425175566 |
9 | 1411672505653 |
10 | 412121103222 |
11 | 149863689684 |
12 | 67a56634986 |
13 | 2cb2a8c4c7a |
14 | 15d37d065ca |
15 | aac0adb79c |
hex | 5ff454fb76 |
412121103222 has 8 divisors (see below), whose sum is σ = 824242206456. Its totient is φ = 137373701072.
The previous prime is 412121103221. The next prime is 412121103223. The reversal of 412121103222 is 222301121214.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (412121103221) and next prime (412121103223).
It is a sphenic number, since it is the product of 3 distinct primes.
412121103222 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (412121103221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34343425263 + ... + 34343425274.
It is an arithmetic number, because the mean of its divisors is an integer number (103030275807).
Almost surely, 2412121103222 is an apocalyptic number.
412121103222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
412121103222 is a wasteful number, since it uses less digits than its factorization.
412121103222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68686850542.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 412121103222 its reverse (222301121214), we get a palindrome (634422224436).
The spelling of 412121103222 in words is "four hundred twelve billion, one hundred twenty-one million, one hundred three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •