Base | Representation |
---|---|
bin | 111101101111111001001… |
… | …011000010011000111111 |
3 | 120000122201210021221101111 |
4 | 331233321023002120333 |
5 | 1024010301131010221 |
6 | 13005203503022451 |
7 | 615366153405046 |
oct | 75577113023077 |
9 | 16018653257344 |
10 | 4243313141311 |
11 | 1396640710a22 |
12 | 586470b9aa27 |
13 | 24a1b1700aba |
14 | 10953da2955d |
15 | 755a1c12be1 |
hex | 3dbf92c263f |
4243313141311 has 8 divisors (see below), whose sum is σ = 4346835895584. Its totient is φ = 4139791687680.
The previous prime is 4243313141297. The next prime is 4243313141329. The reversal of 4243313141311 is 1131413133424.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4243313141311 - 223 = 4243304752703 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4243313142311) 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, 11212566 + ... + 11584828.
It is an arithmetic number, because the mean of its divisors is an integer number (543354486948).
Almost surely, 24243313141311 is an apocalyptic number.
4243313141311 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
4243313141311 is a deficient number, since it is larger than the sum of its proper divisors (103522754273).
4243313141311 is a wasteful number, since it uses less digits than its factorization.
4243313141311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 650321.
The product of its digits is 10368, while the sum is 31.
Adding to 4243313141311 its reverse (1131413133424), we get a palindrome (5374726274735).
The spelling of 4243313141311 in words is "four trillion, two hundred forty-three billion, three hundred thirteen million, one hundred forty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •