Base | Representation |
---|---|
bin | 10000011100011011110… |
… | …011111100010100100101 |
3 | 11000000211122021022011012 |
4 | 100130123303330110211 |
5 | 122003312002000401 |
6 | 2223045023152005 |
7 | 144433343005061 |
oct | 20343363742445 |
9 | 4000748238135 |
10 | 1130043000101 |
11 | 3a62808a46a4 |
12 | 163015145605 |
13 | 82741047602 |
14 | 3c9a1506aa1 |
15 | 1e5dd2708bb |
hex | 1071bcfc525 |
1130043000101 has 4 divisors (see below), whose sum is σ = 1196516117772. Its totient is φ = 1063569882432.
The previous prime is 1130043000083. The next prime is 1130043000109. The reversal of 1130043000101 is 1010003400311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 407491999201 + 722551000900 = 638351^2 + 850030^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130043000101 - 210 = 1130042999077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130043000109) 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, 33236558810 + ... + 33236558843.
It is an arithmetic number, because the mean of its divisors is an integer number (299129029443).
Almost surely, 21130043000101 is an apocalyptic number.
It is an amenable number.
1130043000101 is a deficient number, since it is larger than the sum of its proper divisors (66473117671).
1130043000101 is an equidigital number, since it uses as much as digits as its factorization.
1130043000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66473117670.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1130043000101 its reverse (1010003400311), we get a palindrome (2140046400412).
The spelling of 1130043000101 in words is "one trillion, one hundred thirty billion, forty-three million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •