Base | Representation |
---|---|
bin | 111101100010011… |
… | …100100101000110 |
3 | 2122221201101121111 |
4 | 331202130211012 |
5 | 4103301041014 |
6 | 250240435234 |
7 | 34404411355 |
oct | 7542344506 |
9 | 2587641544 |
10 | 1032440134 |
11 | 48a870610 |
12 | 249918b1a |
13 | 135b87a2b |
14 | 9b19399c |
15 | 6098d2c4 |
hex | 3d89c946 |
1032440134 has 8 divisors (see below), whose sum is σ = 1689447528. Its totient is φ = 469290960.
The previous prime is 1032440131. The next prime is 1032440219. The reversal of 1032440134 is 4310442301.
1032440134 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 46929097 = 1032440134 / (1 + 0 + 3 + 2 + 4 + 4 + 0 + 1 + 3 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032440131) 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, 23464527 + ... + 23464570.
It is an arithmetic number, because the mean of its divisors is an integer number (211180941).
Almost surely, 21032440134 is an apocalyptic number.
1032440134 is a deficient number, since it is larger than the sum of its proper divisors (657007394).
1032440134 is a wasteful number, since it uses less digits than its factorization.
1032440134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46929110.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 1032440134 is about 32131.6064646634. The cubic root of 1032440134 is about 1010.6985116707.
Adding to 1032440134 its reverse (4310442301), we get a palindrome (5342882435).
The spelling of 1032440134 in words is "one billion, thirty-two million, four hundred forty thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •