Base | Representation |
---|---|
bin | 111010001110001110110… |
… | …111010111100000111001 |
3 | 112011111022100212202002101 |
4 | 322032032313113200321 |
5 | 1011023032411301411 |
6 | 12302012252303401 |
7 | 562030536015001 |
oct | 72161667274071 |
9 | 15144270782071 |
10 | 4001011431481 |
11 | 1302901713059 |
12 | 54750a771b61 |
13 | 2303a8508bbc |
14 | db9157c5001 |
15 | 6e11eb988c1 |
hex | 3a38edd7839 |
4001011431481 has 4 divisors (see below), whose sum is σ = 4001033654352. Its totient is φ = 4000989208612.
The previous prime is 4001011431479. The next prime is 4001011431509. The reversal of 4001011431481 is 1841341101004.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4001011431481 - 21 = 4001011431479 is a prime.
It is a super-2 number, since 2×40010114314812 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4001011471481) 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, 10839151 + ... + 11202196.
It is an arithmetic number, because the mean of its divisors is an integer number (1000258413588).
Almost surely, 24001011431481 is an apocalyptic number.
It is an amenable number.
4001011431481 is a deficient number, since it is larger than the sum of its proper divisors (22222871).
4001011431481 is a wasteful number, since it uses less digits than its factorization.
4001011431481 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22222870.
The product of its (nonzero) digits is 1536, while the sum is 28.
Adding to 4001011431481 its reverse (1841341101004), we get a palindrome (5842352532485).
The spelling of 4001011431481 in words is "four trillion, one billion, eleven million, four hundred thirty-one thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •