Base | Representation |
---|---|
bin | 111011101100100000101… |
… | …011010110000011010111 |
3 | 112112011121022001111112001 |
4 | 323230200223112003113 |
5 | 1014202342423013421 |
6 | 12420313254540131 |
7 | 602243244452032 |
oct | 73544053260327 |
9 | 15464538044461 |
10 | 4102242001111 |
11 | 1341829734351 |
12 | 563060667647 |
13 | 239abbc54147 |
14 | 10279a052019 |
15 | 71a96e5b691 |
hex | 3bb20ad60d7 |
4102242001111 has 4 divisors (see below), whose sum is σ = 4111378398000. Its totient is φ = 4093105604224.
The previous prime is 4102242001093. The next prime is 4102242001129. The reversal of 4102242001111 is 1111002422014.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (4102242001093) and next prime (4102242001129).
It is a cyclic number.
It is not a de Polignac number, because 4102242001111 - 29 = 4102242000599 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4102242061111) 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, 4568197771 + ... + 4568198668.
It is an arithmetic number, because the mean of its divisors is an integer number (1027844599500).
Almost surely, 24102242001111 is an apocalyptic number.
4102242001111 is a deficient number, since it is larger than the sum of its proper divisors (9136396889).
4102242001111 is an equidigital number, since it uses as much as digits as its factorization.
4102242001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9136396888.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 4102242001111 its reverse (1111002422014), we get a palindrome (5213244423125).
The spelling of 4102242001111 in words is "four trillion, one hundred two billion, two hundred forty-two million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •