Base | Representation |
---|---|
bin | 11001000010101000011100… |
… | …000011101011010111010011 |
3 | 112102221111222222110212210110 |
4 | 121002220130003223113103 |
5 | 103413400340131131011 |
6 | 1030121541424132403 |
7 | 32124530114226201 |
oct | 3102503403532723 |
9 | 472844888425713 |
10 | 110132022130131 |
11 | 321008013a1651 |
12 | 104283a7467103 |
13 | 495b53609b1a1 |
14 | 1d2a5bdbc6071 |
15 | caebbed5aba6 |
hex | 642a1c0eb5d3 |
110132022130131 has 16 divisors (see below), whose sum is σ = 147057037695360. Its totient is φ = 73314179978880.
The previous prime is 110132022130103. The next prime is 110132022130157. The reversal of 110132022130131 is 131031220231011.
It is not a de Polignac number, because 110132022130131 - 222 = 110132017935827 is a prime.
It is a super-2 number, since 2×1101320221301312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110132022130098 and 110132022130107.
It is not an unprimeable number, because it can be changed into a prime (110132022130171) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 193186396 + ... + 193755638.
It is an arithmetic number, because the mean of its divisors is an integer number (9191064855960).
Almost surely, 2110132022130131 is an apocalyptic number.
110132022130131 is a deficient number, since it is larger than the sum of its proper divisors (36925015565229).
110132022130131 is an equidigital number, since it uses as much as digits as its factorization.
110132022130131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 663266.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 110132022130131 its reverse (131031220231011), we get a palindrome (241163242361142).
The spelling of 110132022130131 in words is "one hundred ten trillion, one hundred thirty-two billion, twenty-two million, one hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •