Base | Representation |
---|---|
bin | 111011110110100011010… |
… | …110010100111010100001 |
3 | 112120012102201202001110202 |
4 | 323312203112110322201 |
5 | 1014341433201210223 |
6 | 12425255223434545 |
7 | 603104401131461 |
oct | 73664326247241 |
9 | 15505381661422 |
10 | 4113024241313 |
11 | 1346361a59a69 |
12 | 56516b5b5a55 |
13 | 23ab19a16930 |
14 | 103100039ba1 |
15 | 71ec8834428 |
hex | 3bda3594ea1 |
4113024241313 has 32 divisors (see below), whose sum is σ = 4465199289600. Its totient is φ = 3766102179840.
The previous prime is 4113024241307. The next prime is 4113024241331. The reversal of 4113024241313 is 3131424203114.
4113024241313 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4113024241313 - 24 = 4113024241297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4113024241363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2195954345 + ... + 2195956217.
It is an arithmetic number, because the mean of its divisors is an integer number (139537477800).
Almost surely, 24113024241313 is an apocalyptic number.
It is an amenable number.
4113024241313 is a deficient number, since it is larger than the sum of its proper divisors (352175048287).
4113024241313 is a wasteful number, since it uses less digits than its factorization.
4113024241313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4329.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 4113024241313 its reverse (3131424203114), we get a palindrome (7244448444427).
The spelling of 4113024241313 in words is "four trillion, one hundred thirteen billion, twenty-four million, two hundred forty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •