Base | Representation |
---|---|
bin | 111101111111110… |
… | …010000001010100 |
3 | 2200111012002022020 |
4 | 331333302001110 |
5 | 4112233131012 |
6 | 251113333140 |
7 | 34526650236 |
oct | 7577620124 |
9 | 2614162266 |
10 | 1040130132 |
11 | 494143188 |
12 | 2504071b0 |
13 | 13764b022 |
14 | 9c1d6256 |
15 | 614aba8c |
hex | 3dff2054 |
1040130132 has 12 divisors (see below), whose sum is σ = 2426970336. Its totient is φ = 346710040.
The previous prime is 1040130109. The next prime is 1040130233. The reversal of 1040130132 is 2310310401.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
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, 43338744 + ... + 43338767.
It is an arithmetic number, because the mean of its divisors is an integer number (202247528).
Almost surely, 21040130132 is an apocalyptic number.
1040130132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1040130132 is an abundant number, since it is smaller than the sum of its proper divisors (1386840204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040130132 is a wasteful number, since it uses less digits than its factorization.
1040130132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86677518 (or 86677516 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1040130132 is about 32251.0485410940. The cubic root of 1040130132 is about 1013.2016598974.
Adding to 1040130132 its reverse (2310310401), we get a palindrome (3350440533).
The spelling of 1040130132 in words is "one billion, forty million, one hundred thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •