Base | Representation |
---|---|
bin | 1111010010100001… |
… | …1010010000101111 |
3 | 101121000211200122211 |
4 | 3310220122100233 |
5 | 31401140442111 |
6 | 1515131551251 |
7 | 203464261612 |
oct | 36450322057 |
9 | 11530750584 |
10 | 4104234031 |
11 | 1816807857 |
12 | 9665bb527 |
13 | 5053b8461 |
14 | 2ad128179 |
15 | 1904b4521 |
hex | f4a1a42f |
4104234031 has 2 divisors, whose sum is σ = 4104234032. Its totient is φ = 4104234030.
The previous prime is 4104233999. The next prime is 4104234041. The reversal of 4104234031 is 1304324014.
4104234031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4104234031 - 25 = 4104233999 is a prime.
It is a super-2 number, since 2×41042340312 = 33689473962437017922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4104233993 and 4104234011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4104234041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2052117015 + 2052117016.
It is an arithmetic number, because the mean of its divisors is an integer number (2052117016).
Almost surely, 24104234031 is an apocalyptic number.
4104234031 is a deficient number, since it is larger than the sum of its proper divisors (1).
4104234031 is an equidigital number, since it uses as much as digits as its factorization.
4104234031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 4104234031 is about 64064.2960704322. The cubic root of 4104234031 is about 1601.0714218275.
Adding to 4104234031 its reverse (1304324014), we get a palindrome (5408558045).
The spelling of 4104234031 in words is "four billion, one hundred four million, two hundred thirty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •