Base | Representation |
---|---|
bin | 1111010010000100… |
… | …1001011111011011 |
3 | 101120220020222021102 |
4 | 3310201021133123 |
5 | 31400144032311 |
6 | 1515023102015 |
7 | 203442142511 |
oct | 36441113733 |
9 | 11526228242 |
10 | 4102330331 |
11 | 1815727550 |
12 | 965a4190b |
13 | 504b9cac8 |
14 | 2acb904b1 |
15 | 19023a43b |
hex | f48497db |
4102330331 has 4 divisors (see below), whose sum is σ = 4475269464. Its totient is φ = 3729391200.
The previous prime is 4102330313. The next prime is 4102330339. The reversal of 4102330331 is 1330332014.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4102330331 is a prime.
It is a super-2 number, since 2×41023303312 = 33658228289285139122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4102330339) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 186469550 + ... + 186469571.
It is an arithmetic number, because the mean of its divisors is an integer number (1118817366).
Almost surely, 24102330331 is an apocalyptic number.
4102330331 is a deficient number, since it is larger than the sum of its proper divisors (372939133).
4102330331 is a wasteful number, since it uses less digits than its factorization.
4102330331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 372939132.
The product of its (nonzero) digits is 648, while the sum is 20.
The square root of 4102330331 is about 64049.4366173505. The cubic root of 4102330331 is about 1600.8238375834.
Adding to 4102330331 its reverse (1330332014), we get a palindrome (5432662345).
It can be divided in two parts, 4102 and 330331, that added together give a palindrome (334433).
The spelling of 4102330331 in words is "four billion, one hundred two million, three hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •