Base | Representation |
---|---|
bin | 111010001110011100100… |
… | …000111001011011110011 |
3 | 112011111220022202200012120 |
4 | 322032130200321123303 |
5 | 1011024020022002011 |
6 | 12302051112325323 |
7 | 562036316265141 |
oct | 72163440713363 |
9 | 15144808680176 |
10 | 4001240422131 |
11 | 1302a099a7127 |
12 | 5475733a3843 |
13 | 230413aa3924 |
14 | db937d92591 |
15 | 6e134d2ca06 |
hex | 3a39c8396f3 |
4001240422131 has 4 divisors (see below), whose sum is σ = 5334987229512. Its totient is φ = 2667493614752.
The previous prime is 4001240422093. The next prime is 4001240422183. The reversal of 4001240422131 is 1312240421004.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4001240422131 - 210 = 4001240421107 is a prime.
It is a super-2 number, since 2×40012404221312 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4001240422331) 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 3 ways as a sum of consecutive naturals, for example, 666873403686 + ... + 666873403691.
It is an arithmetic number, because the mean of its divisors is an integer number (1333746807378).
Almost surely, 24001240422131 is an apocalyptic number.
4001240422131 is a deficient number, since it is larger than the sum of its proper divisors (1333746807381).
4001240422131 is a wasteful number, since it uses less digits than its factorization.
4001240422131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1333746807380.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 4001240422131 its reverse (1312240421004), we get a palindrome (5313480843135).
The spelling of 4001240422131 in words is "four trillion, one billion, two hundred forty million, four hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •