Base | Representation |
---|---|
bin | 1110001001001010100010… |
… | …10111001001000001110010 |
3 | 11002010020200201110002102111 |
4 | 13010211101113021001302 |
5 | 13034030301120223442 |
6 | 150051412114235534 |
7 | 6356663206264021 |
oct | 704452127110162 |
9 | 132106621402374 |
10 | 31101223211122 |
11 | 9a00a55771729 |
12 | 35a3760885baa |
13 | 1447aa977788c |
14 | 7974430a68b8 |
15 | 38e032d4cb17 |
hex | 1c49515c9072 |
31101223211122 has 8 divisors (see below), whose sum is σ = 46652427224172. Its totient is φ = 15550414136400.
The previous prime is 31101223211087. The next prime is 31101223211129. The reversal of 31101223211122 is 22111232210113.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 29879112860041 + 1222110351081 = 5466179^2 + 1105491^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 31101223211093 and 31101223211102.
It is not an unprimeable number, because it can be changed into a prime (31101223211129) 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, 98537629 + ... + 98852752.
Almost surely, 231101223211122 is an apocalyptic number.
31101223211122 is a deficient number, since it is larger than the sum of its proper divisors (15551204013050).
31101223211122 is a wasteful number, since it uses less digits than its factorization.
31101223211122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197469164.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 31101223211122 its reverse (22111232210113), we get a palindrome (53212455421235).
The spelling of 31101223211122 in words is "thirty-one trillion, one hundred one billion, two hundred twenty-three million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •