Base | Representation |
---|---|
bin | 10000011100011001110… |
… | …110100011011011010101 |
3 | 11000000202100102100000222 |
4 | 100130121312203123111 |
5 | 122003230043131013 |
6 | 2223041450444125 |
7 | 144432463424213 |
oct | 20343166433325 |
9 | 4000670370028 |
10 | 1130010130133 |
11 | 3a6264293a35 |
12 | 163006133645 |
13 | 827372a9221 |
14 | 3c99adcbcb3 |
15 | 1e5da42b508 |
hex | 10719da36d5 |
1130010130133 has 4 divisors (see below), whose sum is σ = 1132482800460. Its totient is φ = 1127537459808.
The previous prime is 1130010130013. The next prime is 1130010130181. The reversal of 1130010130133 is 3310310100311.
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 493424763364 + 636585366769 = 702442^2 + 797863^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130010130133 - 222 = 1130005935829 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 (1130010100133) 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, 1236334478 + ... + 1236335391.
It is an arithmetic number, because the mean of its divisors is an integer number (283120700115).
Almost surely, 21130010130133 is an apocalyptic number.
It is an amenable number.
1130010130133 is a deficient number, since it is larger than the sum of its proper divisors (2472670327).
1130010130133 is an equidigital number, since it uses as much as digits as its factorization.
1130010130133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2472670326.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 1130010130133 its reverse (3310310100311), we get a palindrome (4440320230444).
The spelling of 1130010130133 in words is "one trillion, one hundred thirty billion, ten million, one hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •