Base | Representation |
---|---|
bin | 1001100110000110001110… |
… | …10000011001010101100111 |
3 | 2202201011100202212101212111 |
4 | 10303003013100121111213 |
5 | 10231201223403301043 |
6 | 112513150332501451 |
7 | 4305304115323405 |
oct | 463030720312547 |
9 | 82634322771774 |
10 | 21100222322023 |
11 | 67a5610467939 |
12 | 244944591a887 |
13 | ba09861605b0 |
14 | 52d383078475 |
15 | 268cea10009d |
hex | 1330c7419567 |
21100222322023 has 8 divisors (see below), whose sum is σ = 22723851771488. Its totient is φ = 19476669361824.
The previous prime is 21100222322021. The next prime is 21100222322033. The reversal of 21100222322023 is 32022322200112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21100222322023 - 21 = 21100222322021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21100222321985 and 21100222322003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21100222322021) 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, 18548736 + ... + 19653397.
It is an arithmetic number, because the mean of its divisors is an integer number (2840481471436).
Almost surely, 221100222322023 is an apocalyptic number.
21100222322023 is a deficient number, since it is larger than the sum of its proper divisors (1623629449465).
21100222322023 is a wasteful number, since it uses less digits than its factorization.
21100222322023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38244633.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 21100222322023 its reverse (32022322200112), we get a palindrome (53122544522135).
The spelling of 21100222322023 in words is "twenty-one trillion, one hundred billion, two hundred twenty-two million, three hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •