Base | Representation |
---|---|
bin | 111010001111010111001… |
… | …010011111001001000011 |
3 | 112011121102220022002012212 |
4 | 322033113022133021003 |
5 | 1011033023421344021 |
6 | 12302332502412335 |
7 | 562102565060102 |
oct | 72172712371103 |
9 | 15147386262185 |
10 | 4002224403011 |
11 | 130337437956a |
12 | 5477a8a310ab |
13 | 23053c8c2633 |
14 | db9cc930039 |
15 | 6e1913e785b |
hex | 3a3d729f243 |
4002224403011 has 4 divisors (see below), whose sum is σ = 4237649367912. Its totient is φ = 3766799438112.
The previous prime is 4002224402963. The next prime is 4002224403053. The reversal of 4002224403011 is 1103044222004.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-4002224403011 is a prime.
It is a super-2 number, since 2×40022244030112 (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 (4002224403071) 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, 117712482425 + ... + 117712482458.
It is an arithmetic number, because the mean of its divisors is an integer number (1059412341978).
Almost surely, 24002224403011 is an apocalyptic number.
4002224403011 is a deficient number, since it is larger than the sum of its proper divisors (235424964901).
4002224403011 is a wasteful number, since it uses less digits than its factorization.
4002224403011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235424964900.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 4002224403011 its reverse (1103044222004), we get a palindrome (5105268625015).
The spelling of 4002224403011 in words is "four trillion, two billion, two hundred twenty-four million, four hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •