Base | Representation |
---|---|
bin | 11101001110011111001… |
… | …01100100111000111111 |
3 | 10120000001010111101022022 |
4 | 32213033211210320333 |
5 | 112423110242122421 |
6 | 2045154443510355 |
7 | 132360156063131 |
oct | 16471745447077 |
9 | 3500033441268 |
10 | 1004210114111 |
11 | 35797947aa46 |
12 | 142757b283bb |
13 | 739095a6019 |
14 | 36865653051 |
15 | 1b1c61927ab |
hex | e9cf964e3f |
1004210114111 has 8 divisors (see below), whose sum is σ = 1064025396720. Its totient is φ = 944477509248.
The previous prime is 1004210114099. The next prime is 1004210114137. The reversal of 1004210114111 is 1114110124001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1004210114111 - 214 = 1004210097727 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1004210114111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1004210114161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20644421 + ... + 20693006.
It is an arithmetic number, because the mean of its divisors is an integer number (133003174590).
Almost surely, 21004210114111 is an apocalyptic number.
1004210114111 is a deficient number, since it is larger than the sum of its proper divisors (59815282609).
1004210114111 is a wasteful number, since it uses less digits than its factorization.
1004210114111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41338873.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 1004210114111 its reverse (1114110124001), we get a palindrome (2118320238112).
The spelling of 1004210114111 in words is "one trillion, four billion, two hundred ten million, one hundred fourteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •