Base | Representation |
---|---|
bin | 10111000010011001101110… |
… | …100011011111101010010010 |
3 | 111021202002222022001011020120 |
4 | 113002121232203133222102 |
5 | 101240012113111423442 |
6 | 555253454321051110 |
7 | 30225065233141665 |
oct | 2702315643375222 |
9 | 437662868034216 |
10 | 101320133311122 |
11 | 2a313699930a70 |
12 | b44462b786a96 |
13 | 446c5a842291b |
14 | 1b03cc62656dc |
15 | baa880ee54ec |
hex | 5c266e8dfa92 |
101320133311122 has 64 divisors (see below), whose sum is σ = 221435813781504. Its totient is φ = 30651181021440.
The previous prime is 101320133311091. The next prime is 101320133311129. The reversal of 101320133311122 is 221113331023101.
It is a junction number, because it is equal to n+sod(n) for n = 101320133311092 and 101320133311101.
It is not an unprimeable number, because it can be changed into a prime (101320133311129) 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, 301179903 + ... + 301516125.
It is an arithmetic number, because the mean of its divisors is an integer number (3459934590336).
Almost surely, 2101320133311122 is an apocalyptic number.
101320133311122 is an abundant number, since it is smaller than the sum of its proper divisors (120115680470382).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101320133311122 is a wasteful number, since it uses less digits than its factorization.
101320133311122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343943.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 101320133311122 its reverse (221113331023101), we get a palindrome (322433464334223).
The spelling of 101320133311122 in words is "one hundred one trillion, three hundred twenty billion, one hundred thirty-three million, three hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •