Base | Representation |
---|---|
bin | 1001100110001001110000… |
… | …10111100011000011001111 |
3 | 2202201100021000201120011002 |
4 | 10303010320113203003033 |
5 | 10231214120211202343 |
6 | 112514102523050515 |
7 | 4305402130444142 |
oct | 463047027430317 |
9 | 82640230646132 |
10 | 21102120022223 |
11 | 67a63a4692109 |
12 | 2449895370a3b |
13 | ba0bc936a416 |
14 | 52d4c3104059 |
15 | 268daba068b8 |
hex | 1331385e30cf |
21102120022223 has 8 divisors (see below), whose sum is σ = 21604977491328. Its totient is φ = 20599813030104.
The previous prime is 21102120022213. The next prime is 21102120022229. The reversal of 21102120022223 is 32222002120112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21102120022223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21102120022195 and 21102120022204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21102120022229) 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, 137541665 + ... + 137695002.
It is an arithmetic number, because the mean of its divisors is an integer number (2700622186416).
Almost surely, 221102120022223 is an apocalyptic number.
21102120022223 is a deficient number, since it is larger than the sum of its proper divisors (502857469105).
21102120022223 is a wasteful number, since it uses less digits than its factorization.
21102120022223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275238493.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 21102120022223 its reverse (32222002120112), we get a palindrome (53324122142335).
The spelling of 21102120022223 in words is "twenty-one trillion, one hundred two billion, one hundred twenty million, twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •