Base | Representation |
---|---|
bin | 10111001111011111111010… |
… | …000100011001001000011111 |
3 | 111101221011000001210100000020 |
4 | 113033133322010121020133 |
5 | 101344233302231224043 |
6 | 1001223135325003223 |
7 | 30350105626665216 |
oct | 2717377204311037 |
9 | 441834001710006 |
10 | 102220122133023 |
11 | 2a630346086564 |
12 | b56ab400b3513 |
13 | 4506415796b6b |
14 | 1b356a1d7c07d |
15 | bc3ea7564e83 |
hex | 5cf7fa11921f |
102220122133023 has 8 divisors (see below), whose sum is σ = 136403676858288. Its totient is φ = 68091657748224.
The previous prime is 102220122132859. The next prime is 102220122133027. The reversal of 102220122133023 is 320331221022201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102220122133023 - 29 = 102220122132511 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102220122132984 and 102220122133002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102220122133027) 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, 13772580786 + ... + 13772588207.
It is an arithmetic number, because the mean of its divisors is an integer number (17050459607286).
Almost surely, 2102220122133023 is an apocalyptic number.
102220122133023 is a deficient number, since it is larger than the sum of its proper divisors (34183554725265).
102220122133023 is a wasteful number, since it uses less digits than its factorization.
102220122133023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27545170233.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 102220122133023 its reverse (320331221022201), we get a palindrome (422551343155224).
The spelling of 102220122133023 in words is "one hundred two trillion, two hundred twenty billion, one hundred twenty-two million, one hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •