Base | Representation |
---|---|
bin | 111010010111100010010… |
… | …110010111011011010001 |
3 | 112012110002121220021011120 |
4 | 322113202112113123101 |
5 | 1011204013003013410 |
6 | 12310343501032453 |
7 | 562533240322101 |
oct | 72274226273321 |
9 | 15173077807146 |
10 | 4011002001105 |
11 | 1307069076970 |
12 | 549438555729 |
13 | 23130b273b68 |
14 | dc1c25b1201 |
15 | 6e506ce2570 |
hex | 3a5e25976d1 |
4011002001105 has 64 divisors (see below), whose sum is σ = 7017540848640. Its totient is φ = 1940144544000.
The previous prime is 4011002001037. The next prime is 4011002001109. The reversal of 4011002001105 is 5011002001104.
It is a happy number.
It is not a de Polignac number, because 4011002001105 - 211 = 4011001999057 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (4011002001109) 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 63 ways as a sum of consecutive naturals, for example, 138015066 + ... + 138044124.
It is an arithmetic number, because the mean of its divisors is an integer number (109649075760).
Almost surely, 24011002001105 is an apocalyptic number.
It is an amenable number.
4011002001105 is a deficient number, since it is larger than the sum of its proper divisors (3006538847535).
4011002001105 is a wasteful number, since it uses less digits than its factorization.
4011002001105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31022.
The product of its (nonzero) digits is 40, while the sum is 15.
Adding to 4011002001105 its reverse (5011002001104), we get a palindrome (9022004002209).
Subtracting 4011002001105 from its reverse (5011002001104), we obtain a palindrome (999999999999).
The spelling of 4011002001105 in words is "four trillion, eleven billion, two million, one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •