Base | Representation |
---|---|
bin | 100001101011100… |
… | …0101101111110001 |
3 | 2220202112100212102 |
4 | 1003113011233301 |
5 | 4303303020241 |
6 | 304050310145 |
7 | 40001625632 |
oct | 10327055761 |
9 | 2822470772 |
10 | 1130126321 |
11 | 52aa216a5 |
12 | 276588355 |
13 | 15019b2cc |
14 | aa141889 |
15 | 6933739b |
hex | 435c5bf1 |
1130126321 has 8 divisors (see below), whose sum is σ = 1198595904. Its totient is φ = 1063267920.
The previous prime is 1130126311. The next prime is 1130126329. The reversal of 1130126321 is 1236210311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1130126321 - 226 = 1063017457 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1130126293 and 1130126302.
It is not an unprimeable number, because it can be changed into a prime (1130126329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 401351 + ... + 404156.
It is an arithmetic number, because the mean of its divisors is an integer number (149824488).
Almost surely, 21130126321 is an apocalyptic number.
It is an amenable number.
1130126321 is a deficient number, since it is larger than the sum of its proper divisors (68469583).
1130126321 is an equidigital number, since it uses as much as digits as its factorization.
1130126321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 805591.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 1130126321 is about 33617.3514869925. The cubic root of 1130126321 is about 1041.6192480971.
Adding to 1130126321 its reverse (1236210311), we get a palindrome (2366336632).
The spelling of 1130126321 in words is "one billion, one hundred thirty million, one hundred twenty-six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •