Base | Representation |
---|---|
bin | 111111001011001010011… |
… | …100011001110000010001 |
3 | 120101000200121002111212211 |
4 | 333023022130121300101 |
5 | 1032112002213141423 |
6 | 13122212152552121 |
7 | 625435536100216 |
oct | 77131234316021 |
9 | 16330617074784 |
10 | 4341313412113 |
11 | 1424160274967 |
12 | 5a14610b2641 |
13 | 2564cbb2c512 |
14 | 110199261b0d |
15 | 77dda5e010d |
hex | 3f2ca719c11 |
4341313412113 has 8 divisors (see below), whose sum is σ = 4387234779200. Its totient is φ = 4295633102640.
The previous prime is 4341313412099. The next prime is 4341313412119. The reversal of 4341313412113 is 3112143131434.
4341313412113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4341313412113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4341313412119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60228195 + ... + 60300232.
It is an arithmetic number, because the mean of its divisors is an integer number (548404347400).
Almost surely, 24341313412113 is an apocalyptic number.
It is an amenable number.
4341313412113 is a deficient number, since it is larger than the sum of its proper divisors (45921367087).
4341313412113 is a wasteful number, since it uses less digits than its factorization.
4341313412113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120528807.
The product of its digits is 10368, while the sum is 31.
Adding to 4341313412113 its reverse (3112143131434), we get a palindrome (7453456543547).
The spelling of 4341313412113 in words is "four trillion, three hundred forty-one billion, three hundred thirteen million, four hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •