Base | Representation |
---|---|
bin | 10000011100011111110… |
… | …011111100110110011011 |
3 | 11000001000022112220011220 |
4 | 100130133303330312123 |
5 | 122003431142024011 |
6 | 2223055421423123 |
7 | 144435116310051 |
oct | 20343763746633 |
9 | 4001008486156 |
10 | 1130110111131 |
11 | 3a6305772161 |
12 | 16303370aaa3 |
13 | 82751c14191 |
14 | 3c9aa3b61d1 |
15 | 1e5e40ca506 |
hex | 1071fcfcd9b |
1130110111131 has 8 divisors (see below), whose sum is σ = 1511155884864. Its totient is φ = 751235539080.
The previous prime is 1130110111111. The next prime is 1130110111183. The reversal of 1130110111131 is 1311110110311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1130110111131 - 214 = 1130110094747 is a prime.
It is a super-2 number, since 2×11301101111312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1130110111131.
It is not an unprimeable number, because it can be changed into a prime (1130110111111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 542799205 + ... + 542801286.
It is an arithmetic number, because the mean of its divisors is an integer number (188894485608).
Almost surely, 21130110111131 is an apocalyptic number.
1130110111131 is a deficient number, since it is larger than the sum of its proper divisors (381045773733).
1130110111131 is a wasteful number, since it uses less digits than its factorization.
1130110111131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1085600841.
The product of its (nonzero) digits is 9, while the sum is 15.
Adding to 1130110111131 its reverse (1311110110311), we get a palindrome (2441220221442).
The spelling of 1130110111131 in words is "one trillion, one hundred thirty billion, one hundred ten million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •