Base | Representation |
---|---|
bin | 10000011100100101001… |
… | …110101011000010010011 |
3 | 11000001020122120122012020 |
4 | 100130211032223002103 |
5 | 122004122424032011 |
6 | 2223112425502523 |
7 | 144440302003305 |
oct | 20344516530223 |
9 | 4001218518166 |
10 | 1130201002131 |
11 | 3a6352001993 |
12 | 16305a041a43 |
13 | 827679b8836 |
14 | 3c9b84b5975 |
15 | 1e5ec081006 |
hex | 107253ab093 |
1130201002131 has 8 divisors (see below), whose sum is σ = 1522470078864. Its totient is φ = 745699630080.
The previous prime is 1130201002081. The next prime is 1130201002153. The reversal of 1130201002131 is 1312001020311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1130201002131 - 219 = 1130200477843 is a prime.
It is a super-2 number, since 2×11302010021312 (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 1130201002131.
It is not an unprimeable number, because it can be changed into a prime (1130201002171) 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, 1941925830 + ... + 1941926411.
It is an arithmetic number, because the mean of its divisors is an integer number (190308759858).
Almost surely, 21130201002131 is an apocalyptic number.
1130201002131 is a deficient number, since it is larger than the sum of its proper divisors (392269076733).
1130201002131 is an equidigital number, since it uses as much as digits as its factorization.
1130201002131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3883852341.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1130201002131 its reverse (1312001020311), we get a palindrome (2442202022442).
The spelling of 1130201002131 in words is "one trillion, one hundred thirty billion, two hundred one million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •