Base | Representation |
---|---|
bin | 100001110001111101000… |
… | …0111110111000010001111 |
3 | 121102211202222222212101212 |
4 | 1003203322013313002033 |
5 | 1102031333311402421 |
6 | 13512504401525035 |
7 | 656266642511201 |
oct | 103437207670217 |
9 | 17384688885355 |
10 | 4642761044111 |
11 | 152aa90633543 |
12 | 62b96b34377b |
13 | 278a6c8461b8 |
14 | 1209d4754771 |
15 | 80b7ee01e5b |
hex | 438fa1f708f |
4642761044111 has 4 divisors (see below), whose sum is σ = 4645639384872. Its totient is φ = 4639882703352.
The previous prime is 4642761044101. The next prime is 4642761044137. The reversal of 4642761044111 is 1114401672464.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4642761044111 is a prime.
It is a super-2 number, since 2×46427610441112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4642761044101) 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, 1439167961 + ... + 1439171186.
It is an arithmetic number, because the mean of its divisors is an integer number (1161409846218).
Almost surely, 24642761044111 is an apocalyptic number.
4642761044111 is a deficient number, since it is larger than the sum of its proper divisors (2878340761).
4642761044111 is a wasteful number, since it uses less digits than its factorization.
4642761044111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2878340760.
The product of its (nonzero) digits is 129024, while the sum is 41.
The spelling of 4642761044111 in words is "four trillion, six hundred forty-two billion, seven hundred sixty-one million, forty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •