Base | Representation |
---|---|
bin | 111110000000100100010… |
… | …001110010111010110111 |
3 | 120002100221111001200020222 |
4 | 332000210101302322313 |
5 | 1024303432321434143 |
6 | 13021324203444555 |
7 | 616601624044355 |
oct | 76004421627267 |
9 | 16070844050228 |
10 | 4261216202423 |
11 | 13a31985027a4 |
12 | 589a2882675b |
13 | 24baa581cc9b |
14 | 10a35b6207d5 |
15 | 75c9d81d768 |
hex | 3e024472eb7 |
4261216202423 has 4 divisors (see below), whose sum is σ = 4261363063608. Its totient is φ = 4261069341240.
The previous prime is 4261216202371. The next prime is 4261216202491. The reversal of 4261216202423 is 3242026121624.
4261216202423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 4261216202423 - 26 = 4261216202359 is a prime.
It is a super-2 number, since 2×42612162024232 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4261216222423) 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, 73387061 + ... + 73445102.
It is an arithmetic number, because the mean of its divisors is an integer number (1065340765902).
Almost surely, 24261216202423 is an apocalyptic number.
4261216202423 is a deficient number, since it is larger than the sum of its proper divisors (146861185).
4261216202423 is a wasteful number, since it uses less digits than its factorization.
4261216202423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146861184.
The product of its (nonzero) digits is 55296, while the sum is 35.
The spelling of 4261216202423 in words is "four trillion, two hundred sixty-one billion, two hundred sixteen million, two hundred two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •