Base | Representation |
---|---|
bin | 10000011100100001101… |
… | …001110111000000000001 |
3 | 11000001002110201020101210 |
4 | 100130201221313000001 |
5 | 122004012100121121 |
6 | 2223102444120333 |
7 | 144435643112616 |
oct | 20344151670001 |
9 | 4001073636353 |
10 | 1130141020161 |
11 | 3a632116360a |
12 | 163041b360a9 |
13 | 82758446b4a |
14 | 3c9b054050d |
15 | 1e5e6b83876 |
hex | 10721a77001 |
1130141020161 has 4 divisors (see below), whose sum is σ = 1506854693552. Its totient is φ = 753427346772.
The previous prime is 1130141020121. The next prime is 1130141020219. The reversal of 1130141020161 is 1610201410311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1130141020161 - 26 = 1130141020097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1130141020121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 188356836691 + ... + 188356836696.
It is an arithmetic number, because the mean of its divisors is an integer number (376713673388).
Almost surely, 21130141020161 is an apocalyptic number.
It is an amenable number.
1130141020161 is a deficient number, since it is larger than the sum of its proper divisors (376713673391).
1130141020161 is an equidigital number, since it uses as much as digits as its factorization.
1130141020161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376713673390.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 1130141020161 its reverse (1610201410311), we get a palindrome (2740342430472).
The spelling of 1130141020161 in words is "one trillion, one hundred thirty billion, one hundred forty-one million, twenty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •