Base | Representation |
---|---|
bin | 11001000010100111100000… |
… | …111111101000000001100011 |
3 | 112102221102102220220000211210 |
4 | 121002213200333220001203 |
5 | 103413341322442242011 |
6 | 1030121255225241203 |
7 | 32124463422452346 |
oct | 3102474077500143 |
9 | 472842386800753 |
10 | 110131031212131 |
11 | 32100343011256 |
12 | 1042816b633203 |
13 | 495b4089c0a87 |
14 | 1d2a52836045d |
15 | caeb62d706a6 |
hex | 6429e0fe8063 |
110131031212131 has 32 divisors (see below), whose sum is σ = 151552442216448. Its totient is φ = 71093081928960.
The previous prime is 110131031212129. The next prime is 110131031212159. The reversal of 110131031212131 is 131212130131011.
It is not a de Polignac number, because 110131031212131 - 21 = 110131031212129 is a prime.
It is a super-2 number, since 2×1101310312121312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110131031212098 and 110131031212107.
It is not an unprimeable number, because it can be changed into a prime (110131031212031) 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, 13822270 + ... + 20280956.
It is an arithmetic number, because the mean of its divisors is an integer number (4736013819264).
Almost surely, 2110131031212131 is an apocalyptic number.
110131031212131 is a deficient number, since it is larger than the sum of its proper divisors (41421411004317).
110131031212131 is a wasteful number, since it uses less digits than its factorization.
110131031212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6459771.
The product of its (nonzero) digits is 108, while the sum is 21.
Adding to 110131031212131 its reverse (131212130131011), we get a palindrome (241343161343142).
The spelling of 110131031212131 in words is "one hundred ten trillion, one hundred thirty-one billion, thirty-one million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •