Base | Representation |
---|---|
bin | 101111000010101010… |
… | …0111101011110011111 |
3 | 100122202100001012212221 |
4 | 1132011110331132133 |
5 | 3123342401042343 |
6 | 114224121010211 |
7 | 10204253200033 |
oct | 1360524753637 |
9 | 318670035787 |
10 | 101021112223 |
11 | 3992a8698a9 |
12 | 176b3923967 |
13 | 96ac22c365 |
14 | 4c649061c3 |
15 | 2963bdb5ed |
hex | 178553d79f |
101021112223 has 2 divisors, whose sum is σ = 101021112224. Its totient is φ = 101021112222.
The previous prime is 101021112221. The next prime is 101021112271. The reversal of 101021112223 is 322211120101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101021112223 - 21 = 101021112221 is a prime.
It is a super-2 number, since 2×1010211122232 (a number of 23 digits) contains 22 as substring.
Together with 101021112221, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 101021112197 and 101021112206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101021112221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50510556111 + 50510556112.
It is an arithmetic number, because the mean of its divisors is an integer number (50510556112).
Almost surely, 2101021112223 is an apocalyptic number.
101021112223 is a deficient number, since it is larger than the sum of its proper divisors (1).
101021112223 is an equidigital number, since it uses as much as digits as its factorization.
101021112223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 101021112223 its reverse (322211120101), we get a palindrome (423232232324).
The spelling of 101021112223 in words is "one hundred one billion, twenty-one million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •