Base | Representation |
---|---|
bin | 111101101101110110000… |
… | …011010110111101001111 |
3 | 120000110001110221002101200 |
4 | 331231312003112331033 |
5 | 1023441300002004403 |
6 | 13004201321040543 |
7 | 615260512232532 |
oct | 75556603267517 |
9 | 16013043832350 |
10 | 4241113313103 |
11 | 1395711999487 |
12 | 585b58326153 |
13 | 249c20a2c6c4 |
14 | 1093b17d4a19 |
15 | 754c3a2bca3 |
hex | 3db760d6f4f |
4241113313103 has 6 divisors (see below), whose sum is σ = 6126052563384. Its totient is φ = 2827408875396.
The previous prime is 4241113313077. The next prime is 4241113313119. The reversal of 4241113313103 is 3013133111424.
4241113313103 is a `hidden beast` number, since 4 + 2 + 4 + 1 + 11 + 331 + 310 + 3 = 666.
It is not a de Polignac number, because 4241113313103 - 218 = 4241113050959 is a prime.
It is a super-2 number, since 2×42411133131032 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4241113313123) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 235617406275 + ... + 235617406292.
It is an arithmetic number, because the mean of its divisors is an integer number (1021008760564).
Almost surely, 24241113313103 is an apocalyptic number.
4241113313103 is a deficient number, since it is larger than the sum of its proper divisors (1884939250281).
4241113313103 is a wasteful number, since it uses less digits than its factorization.
4241113313103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 471234812573 (or 471234812570 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 4241113313103 its reverse (3013133111424), we get a palindrome (7254246424527).
The spelling of 4241113313103 in words is "four trillion, two hundred forty-one billion, one hundred thirteen million, three hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •