Base | Representation |
---|---|
bin | 1100110010000100… |
… | …0111001000000001 |
3 | 22212010110122102201 |
4 | 3030201013020001 |
5 | 24011343411001 |
6 | 1324251113201 |
7 | 151012663561 |
oct | 31441071001 |
9 | 8763418381 |
10 | 3431232001 |
11 | 150092842a |
12 | 7b9142801 |
13 | 428b3c7c2 |
14 | 2479bada1 |
15 | 151376501 |
hex | cc847201 |
3431232001 has 2 divisors, whose sum is σ = 3431232002. Its totient is φ = 3431232000.
The previous prime is 3431231959. The next prime is 3431232029. The reversal of 3431232001 is 1002321343.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2724735601 + 706496400 = 52199^2 + 26580^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3431232001 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3431232001.
It is not a weakly prime, because it can be changed into another prime (3431232061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1715616000 + 1715616001.
It is an arithmetic number, because the mean of its divisors is an integer number (1715616001).
Almost surely, 23431232001 is an apocalyptic number.
It is an amenable number.
3431232001 is a deficient number, since it is larger than the sum of its proper divisors (1).
3431232001 is an equidigital number, since it uses as much as digits as its factorization.
3431232001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 3431232001 is about 58576.7189333783. The cubic root of 3431232001 is about 1508.2848237003.
Adding to 3431232001 its reverse (1002321343), we get a palindrome (4433553344).
The spelling of 3431232001 in words is "three billion, four hundred thirty-one million, two hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •