Base | Representation |
---|---|
bin | 110001011111100111100… |
… | …100011011000001111011 |
3 | 110001011002202210011010222 |
4 | 301133213210123001323 |
5 | 421211131234402211 |
6 | 11122254110130255 |
7 | 500505003552524 |
oct | 61374744330173 |
9 | 13034082704128 |
10 | 3401204215931 |
11 | 10a1496124355 |
12 | 46b2144b098b |
13 | 1b89697aa642 |
14 | ba894da584b |
15 | 5d716c0c1db |
hex | 317e791b07b |
3401204215931 has 2 divisors, whose sum is σ = 3401204215932. Its totient is φ = 3401204215930.
The previous prime is 3401204215883. The next prime is 3401204215999. The reversal of 3401204215931 is 1395124021043.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (1395124021043) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3401204215931 - 222 = 3401200021627 is a prime.
It is a super-2 number, since 2×34012042159312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3401204215891 and 3401204215900.
It is not a weakly prime, because it can be changed into another prime (3401204214931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1700602107965 + 1700602107966.
It is an arithmetic number, because the mean of its divisors is an integer number (1700602107966).
Almost surely, 23401204215931 is an apocalyptic number.
3401204215931 is a deficient number, since it is larger than the sum of its proper divisors (1).
3401204215931 is an equidigital number, since it uses as much as digits as its factorization.
3401204215931 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25920, while the sum is 35.
Adding to 3401204215931 its reverse (1395124021043), we get a palindrome (4796328236974).
The spelling of 3401204215931 in words is "three trillion, four hundred one billion, two hundred four million, two hundred fifteen thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •