Base | Representation |
---|---|
bin | 101100101101101011100… |
… | …1110111000100010110101 |
3 | 210202111101111002010122022 |
4 | 1121123113032320202311 |
5 | 1301141302021030331 |
6 | 21023055254442525 |
7 | 1202664044062112 |
oct | 131332716704265 |
9 | 23674344063568 |
10 | 6145414236341 |
11 | 1a5a28a142486 |
12 | 833032963445 |
13 | 357682837b23 |
14 | 17362250b909 |
15 | a9cca18767b |
hex | 596d73b88b5 |
6145414236341 has 2 divisors, whose sum is σ = 6145414236342. Its totient is φ = 6145414236340.
The previous prime is 6145414236331. The next prime is 6145414236347. The reversal of 6145414236341 is 1436324145416.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6108682980625 + 36731255716 = 2471575^2 + 191654^2 .
It is a cyclic number.
It is not a de Polignac number, because 6145414236341 - 226 = 6145347127477 is a prime.
It is a super-2 number, since 2×61454142363412 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6145414236292 and 6145414236301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6145414236347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3072707118170 + 3072707118171.
It is an arithmetic number, because the mean of its divisors is an integer number (3072707118171).
Almost surely, 26145414236341 is an apocalyptic number.
It is an amenable number.
6145414236341 is a deficient number, since it is larger than the sum of its proper divisors (1).
6145414236341 is an equidigital number, since it uses as much as digits as its factorization.
6145414236341 is an evil number, because the sum of its binary digits is even.
The product of its digits is 829440, while the sum is 44.
The spelling of 6145414236341 in words is "six trillion, one hundred forty-five billion, four hundred fourteen million, two hundred thirty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •