Base | Representation |
---|---|
bin | 111010001111011110001… |
… | …000001100011000111111 |
3 | 112011121202001011010202210 |
4 | 322033132020030120333 |
5 | 1011033243324224211 |
6 | 12302352234551503 |
7 | 562105514145600 |
oct | 72173610143077 |
9 | 15147661133683 |
10 | 4002341242431 |
11 | 1303424321774 |
12 | 54781bb98593 |
13 | 23055ab80a9c |
14 | dba00265da7 |
15 | 6e19b7c69a6 |
hex | 3a3de20c63f |
4002341242431 has 12 divisors (see below), whose sum is σ = 6207712947672. Its totient is φ = 2287052138448.
The previous prime is 4002341242399. The next prime is 4002341242439. The reversal of 4002341242431 is 1342421432004.
It is not a de Polignac number, because 4002341242431 - 25 = 4002341242399 is a prime.
It is a super-2 number, since 2×40023412424312 (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 (4002341242439) 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 11 ways as a sum of consecutive naturals, for example, 13613405440 + ... + 13613405733.
It is an arithmetic number, because the mean of its divisors is an integer number (517309412306).
Almost surely, 24002341242431 is an apocalyptic number.
4002341242431 is a deficient number, since it is larger than the sum of its proper divisors (2205371705241).
4002341242431 is a wasteful number, since it uses less digits than its factorization.
4002341242431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27226811190 (or 27226811183 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 4002341242431 its reverse (1342421432004), we get a palindrome (5344762674435).
The spelling of 4002341242431 in words is "four trillion, two billion, three hundred forty-one million, two hundred forty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •