Base | Representation |
---|---|
bin | 1100110010000100… |
… | …0000010110100101 |
3 | 22212010102020101022 |
4 | 3030201000112211 |
5 | 24011342014021 |
6 | 1324250340525 |
7 | 151012516652 |
oct | 31441002645 |
9 | 8763366338 |
10 | 3431204261 |
11 | 1500909601 |
12 | 7b912a745 |
13 | 428b2cca4 |
14 | 2479b0c29 |
15 | 15136d1ab |
hex | cc8405a5 |
3431204261 has 2 divisors, whose sum is σ = 3431204262. Its totient is φ = 3431204260.
The previous prime is 3431204237. The next prime is 3431204267. The reversal of 3431204261 is 1624021343.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2015112100 + 1416092161 = 44890^2 + 37631^2 .
It is a cyclic number.
It is not a de Polignac number, because 3431204261 - 218 = 3430942117 is a prime.
It is a super-3 number, since 3×34312042613 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 3431204261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3431204267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1715602130 + 1715602131.
It is an arithmetic number, because the mean of its divisors is an integer number (1715602131).
Almost surely, 23431204261 is an apocalyptic number.
It is an amenable number.
3431204261 is a deficient number, since it is larger than the sum of its proper divisors (1).
3431204261 is an equidigital number, since it uses as much as digits as its factorization.
3431204261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
The square root of 3431204261 is about 58576.4821494087. The cubic root of 3431204261 is about 1508.2807590831.
The spelling of 3431204261 in words is "three billion, four hundred thirty-one million, two hundred four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •