Base | Representation |
---|---|
bin | 111011101100011111100… |
… | …000001101000001000111 |
3 | 112112011112220222202012121 |
4 | 323230133200031001013 |
5 | 1014202322402201203 |
6 | 12420311312430411 |
7 | 602242615152025 |
oct | 73543740150107 |
9 | 15464486882177 |
10 | 4102222303303 |
11 | 1341819600073 |
12 | 563055b48407 |
13 | 239ab7b48437 |
14 | 1027975a5715 |
15 | 71a9536a0bd |
hex | 3bb1f80d047 |
4102222303303 has 4 divisors (see below), whose sum is σ = 4126786508880. Its totient is φ = 4077658097728.
The previous prime is 4102222303259. The next prime is 4102222303337. The reversal of 4102222303303 is 3033032222014.
4102222303303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4102222303303 - 213 = 4102222295111 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 (4102222300303) 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, 12282102538 + ... + 12282102871.
It is an arithmetic number, because the mean of its divisors is an integer number (1031696627220).
Almost surely, 24102222303303 is an apocalyptic number.
4102222303303 is a deficient number, since it is larger than the sum of its proper divisors (24564205577).
4102222303303 is a wasteful number, since it uses less digits than its factorization.
4102222303303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24564205576.
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 4102222303303 its reverse (3033032222014), we get a palindrome (7135254525317).
The spelling of 4102222303303 in words is "four trillion, one hundred two billion, two hundred twenty-two million, three hundred three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •