Base | Representation |
---|---|
bin | 10111000010011011100101… |
… | …100101011111011100010111 |
3 | 111021202022010110202212211201 |
4 | 113002123211211133130113 |
5 | 101240030210330320343 |
6 | 555254424420013331 |
7 | 30225165562360465 |
oct | 2702334545373427 |
9 | 437668113685751 |
10 | 101322130323223 |
11 | 2a314524117797 |
12 | b444aa8531247 |
13 | 446c836091ca4 |
14 | 1b04035583835 |
15 | baa94b4b794d |
hex | 5c26e595f717 |
101322130323223 has 2 divisors, whose sum is σ = 101322130323224. Its totient is φ = 101322130323222.
The previous prime is 101322130323221. The next prime is 101322130323269. The reversal of 101322130323223 is 322323031223101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101322130323223 - 21 = 101322130323221 is a prime.
Together with 101322130323221, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 101322130323191 and 101322130323200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101322130323221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50661065161611 + 50661065161612.
It is an arithmetic number, because the mean of its divisors is an integer number (50661065161612).
Almost surely, 2101322130323223 is an apocalyptic number.
101322130323223 is a deficient number, since it is larger than the sum of its proper divisors (1).
101322130323223 is an equidigital number, since it uses as much as digits as its factorization.
101322130323223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 101322130323223 its reverse (322323031223101), we get a palindrome (423645161546324).
The spelling of 101322130323223 in words is "one hundred one trillion, three hundred twenty-two billion, one hundred thirty million, three hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •