Base | Representation |
---|---|
bin | 1011010010111111… |
… | …0110011000111111 |
3 | 21211100002000222122 |
4 | 2310233312120333 |
5 | 22202301124211 |
6 | 1220523433155 |
7 | 135101223014 |
oct | 26457663077 |
9 | 7740060878 |
10 | 3032442431 |
11 | 1316809977 |
12 | 7076857bb |
13 | 394333145 |
14 | 20aa4d70b |
15 | 12b3516db |
hex | b4bf663f |
3032442431 has 8 divisors (see below), whose sum is σ = 3153835344. Its totient is φ = 2913361920.
The previous prime is 3032442419. The next prime is 3032442463. The reversal of 3032442431 is 1342442303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3032442431 - 26 = 3032442367 is a prime.
It is a super-2 number, since 2×30324424312 = 18391414194658379522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3032442431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3032442481) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 575426 + ... + 580671.
It is an arithmetic number, because the mean of its divisors is an integer number (394229418).
Almost surely, 23032442431 is an apocalyptic number.
3032442431 is a deficient number, since it is larger than the sum of its proper divisors (121392913).
3032442431 is a wasteful number, since it uses less digits than its factorization.
3032442431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1156201.
The product of its (nonzero) digits is 6912, while the sum is 26.
The square root of 3032442431 is about 55067.6168995899. The cubic root of 3032442431 is about 1447.4298395681.
Adding to 3032442431 its reverse (1342442303), we get a palindrome (4374884734).
The spelling of 3032442431 in words is "three billion, thirty-two million, four hundred forty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •