Base | Representation |
---|---|
bin | 101111100110011101… |
… | …0000100001001100111 |
3 | 100202212000202201100001 |
4 | 1133030322010021213 |
5 | 3133322314134343 |
6 | 114543220402131 |
7 | 10246104562330 |
oct | 1371472041147 |
9 | 322760681301 |
10 | 102222021223 |
11 | 3a396736583 |
12 | 17989b46347 |
13 | 9840c814ba |
14 | 4d3a1d1287 |
15 | 29d435644d |
hex | 17cce84267 |
102222021223 has 4 divisors (see below), whose sum is σ = 116825167120. Its totient is φ = 87618875328.
The previous prime is 102222021221. The next prime is 102222021257. The reversal of 102222021223 is 322120222201.
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 102222021223 - 21 = 102222021221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102222021223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102222021221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7301572938 + ... + 7301572951.
It is an arithmetic number, because the mean of its divisors is an integer number (29206291780).
Almost surely, 2102222021223 is an apocalyptic number.
102222021223 is a deficient number, since it is larger than the sum of its proper divisors (14603145897).
102222021223 is an equidigital number, since it uses as much as digits as its factorization.
102222021223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14603145896.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 102222021223 its reverse (322120222201), we get a palindrome (424342243424).
The spelling of 102222021223 in words is "one hundred two billion, two hundred twenty-two million, twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •