Base | Representation |
---|---|
bin | 1111110011001011… |
… | …1110000110110111 |
3 | 101221120121022010002 |
4 | 3330302332012313 |
5 | 32141223020043 |
6 | 1540504021515 |
7 | 210046526645 |
oct | 37462760667 |
9 | 11846538102 |
10 | 4241220023 |
11 | 1887070417 |
12 | 9a446189b |
13 | 5278ab961 |
14 | 2c33c6195 |
15 | 19c522bb8 |
hex | fccbe1b7 |
4241220023 has 2 divisors, whose sum is σ = 4241220024. Its totient is φ = 4241220022.
The previous prime is 4241219971. The next prime is 4241220077. The reversal of 4241220023 is 3200221424.
4241220023 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4241220023 - 216 = 4241154487 is a prime.
It is a super-2 number, since 2×42412200232 = 35975894566992241058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4241219977 and 4241220004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4241220923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2120610011 + 2120610012.
It is an arithmetic number, because the mean of its divisors is an integer number (2120610012).
Almost surely, 24241220023 is an apocalyptic number.
4241220023 is a deficient number, since it is larger than the sum of its proper divisors (1).
4241220023 is an equidigital number, since it uses as much as digits as its factorization.
4241220023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 20.
The square root of 4241220023 is about 65124.6498877345. The cubic root of 4241220023 is about 1618.6896917490.
Adding to 4241220023 its reverse (3200221424), we get a palindrome (7441441447).
The spelling of 4241220023 in words is "four billion, two hundred forty-one million, two hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •