Base | Representation |
---|---|
bin | 111101011101011… |
… | …100111000001100 |
3 | 2122212020212022120 |
4 | 331131130320030 |
5 | 4102432140021 |
6 | 250152412540 |
7 | 34360315524 |
oct | 7535347014 |
9 | 2585225276 |
10 | 1031130636 |
11 | 48a056788 |
12 | 2493a7150 |
13 | 135819993 |
14 | 9ad32684 |
15 | 607d02c6 |
hex | 3d75ce0c |
1031130636 has 12 divisors (see below), whose sum is σ = 2405971512. Its totient is φ = 343710208.
The previous prime is 1031130619. The next prime is 1031130671. The reversal of 1031130636 is 6360311301.
It is a tau number, because it is divible by the number of its divisors (12).
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 42963765 + ... + 42963788.
It is an arithmetic number, because the mean of its divisors is an integer number (200497626).
Almost surely, 21031130636 is an apocalyptic number.
It is an amenable number.
1031130636 is an abundant number, since it is smaller than the sum of its proper divisors (1374840876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031130636 is a wasteful number, since it uses less digits than its factorization.
1031130636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85927560 (or 85927558 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
The square root of 1031130636 is about 32111.2228979215. Note that the first 3 decimals coincide. The cubic root of 1031130636 is about 1010.2710235647.
Adding to 1031130636 its reverse (6360311301), we get a palindrome (7391441937).
It can be divided in two parts, 1031130 and 636, that added together give a triangular number (1031766 = T1436).
The spelling of 1031130636 in words is "one billion, thirty-one million, one hundred thirty thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •