Base | Representation |
---|---|
bin | 10111010000111110111000… |
… | …100011100001101001100111 |
3 | 111102021220020020022011122122 |
4 | 113100332320203201221213 |
5 | 101402421131131310343 |
6 | 1001342042544020155 |
7 | 30360346036242254 |
oct | 2720767043415147 |
9 | 442256206264578 |
10 | 102322102213223 |
11 | 2a66a618193182 |
12 | b58686100165b |
13 | 4512c18597b99 |
14 | 1b3a5b7d9042b |
15 | bc697552a068 |
hex | 5d0fb88e1a67 |
102322102213223 has 32 divisors (see below), whose sum is σ = 106882288663872. Its totient is φ = 97872344064000.
The previous prime is 102322102213211. The next prime is 102322102213241. The reversal of 102322102213223 is 322312201223201.
It is a cyclic number.
It is not a de Polignac number, because 102322102213223 - 216 = 102322102147687 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102322102213192 and 102322102213201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102322102213823) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 377073413 + ... + 377344673.
It is an arithmetic number, because the mean of its divisors is an integer number (3340071520746).
Almost surely, 2102322102213223 is an apocalyptic number.
102322102213223 is a deficient number, since it is larger than the sum of its proper divisors (4560186450649).
102322102213223 is a wasteful number, since it uses less digits than its factorization.
102322102213223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272115.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 102322102213223 its reverse (322312201223201), we get a palindrome (424634303436424).
The spelling of 102322102213223 in words is "one hundred two trillion, three hundred twenty-two billion, one hundred two million, two hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.219 sec. • engine limits •