Base | Representation |
---|---|
bin | 1100101010101010… |
… | …0101100010010111 |
3 | 22202222000002121212 |
4 | 3022222211202113 |
5 | 23430420131211 |
6 | 1321221132035 |
7 | 150154616042 |
oct | 31252454227 |
9 | 8688002555 |
10 | 3400161431 |
11 | 1495336677 |
12 | 7aa85a01b |
13 | 422581454 |
14 | 24380dc59 |
15 | 14d78a38b |
hex | caaa5897 |
3400161431 has 2 divisors, whose sum is σ = 3400161432. Its totient is φ = 3400161430.
The previous prime is 3400161407. The next prime is 3400161439. The reversal of 3400161431 is 1341610043.
3400161431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3400161431 - 218 = 3399899287 is a prime.
It is a super-2 number, since 2×34001614312 = 23122195513719935522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3400161397 and 3400161406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3400161439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1700080715 + 1700080716.
It is an arithmetic number, because the mean of its divisors is an integer number (1700080716).
Almost surely, 23400161431 is an apocalyptic number.
3400161431 is a deficient number, since it is larger than the sum of its proper divisors (1).
3400161431 is an equidigital number, since it uses as much as digits as its factorization.
3400161431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 3400161431 is about 58310.9031914272. The cubic root of 3400161431 is about 1503.7183941541.
Adding to 3400161431 its reverse (1341610043), we get a palindrome (4741771474).
The spelling of 3400161431 in words is "three billion, four hundred million, one hundred sixty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •