Base | Representation |
---|---|
bin | 111101010110110101101… |
… | …111111000100111001011 |
3 | 112221002022000022210102101 |
4 | 331112311233320213023 |
5 | 1023040203002133443 |
6 | 12544554253214231 |
7 | 613424423620462 |
oct | 75266557704713 |
9 | 15832260283371 |
10 | 4216412146123 |
11 | 138619680a0a1 |
12 | 581203a91377 |
13 | 2477b53a5a78 |
14 | 10810add99d9 |
15 | 74a2a1d784d |
hex | 3d5b5bf89cb |
4216412146123 has 4 divisors (see below), whose sum is σ = 4279343670760. Its totient is φ = 4153480621488.
The previous prime is 4216412146097. The next prime is 4216412146127. The reversal of 4216412146123 is 3216412146124.
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 4216412146123 - 229 = 4215875275211 is a prime.
It is a super-3 number, since 3×42164121461233 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4216412146127) 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, 31465762218 + ... + 31465762351.
It is an arithmetic number, because the mean of its divisors is an integer number (1069835917690).
Almost surely, 24216412146123 is an apocalyptic number.
4216412146123 is a deficient number, since it is larger than the sum of its proper divisors (62931524637).
4216412146123 is an equidigital number, since it uses as much as digits as its factorization.
4216412146123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62931524636.
The product of its digits is 55296, while the sum is 37.
Subtracting from 4216412146123 its reverse (3216412146124), we obtain a palindrome (999999999999).
The spelling of 4216412146123 in words is "four trillion, two hundred sixteen billion, four hundred twelve million, one hundred forty-six thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •