Base | Representation |
---|---|
bin | 101111001011010100… |
… | …0010111111111001110 |
3 | 100200111120022002100211 |
4 | 1132112220113333032 |
5 | 3124441210223342 |
6 | 114313011113034 |
7 | 10214406545404 |
oct | 1362650277716 |
9 | 320446262324 |
10 | 101311414222 |
11 | 39a6971a007 |
12 | 17774ba277a |
13 | 9727412ba5 |
14 | 4c912b3474 |
15 | 297e431c17 |
hex | 1796a17fce |
101311414222 has 4 divisors (see below), whose sum is σ = 151967121336. Its totient is φ = 50655707110.
The previous prime is 101311414213. The next prime is 101311414261. The reversal of 101311414222 is 222414113101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 222414113101 = 22531 ⋅9871471.
It is a junction number, because it is equal to n+sod(n) for n = 101311414193 and 101311414202.
It is a congruent number.
It is an unprimeable number.
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, 25327853554 + ... + 25327853557.
It is an arithmetic number, because the mean of its divisors is an integer number (37991780334).
Almost surely, 2101311414222 is an apocalyptic number.
101311414222 is a deficient number, since it is larger than the sum of its proper divisors (50655707114).
101311414222 is an equidigital number, since it uses as much as digits as its factorization.
101311414222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50655707113.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 101311414222 its reverse (222414113101), we get a palindrome (323725527323).
The spelling of 101311414222 in words is "one hundred one billion, three hundred eleven million, four hundred fourteen thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •