Base | Representation |
---|---|
bin | 10010110101101110101110… |
… | …01001000110100000011011 |
3 | 12102200112101012122021210221 |
4 | 21122313113021012200123 |
5 | 20412231202134313212 |
6 | 224040004421020511 |
7 | 11504054363504035 |
oct | 1132672711064033 |
9 | 172615335567727 |
10 | 41428569057307 |
11 | 12222837212a23 |
12 | 4791173b54737 |
13 | 1a1690ac72b73 |
14 | a33221084c55 |
15 | 4bc9bb04c807 |
hex | 25add724681b |
41428569057307 has 2 divisors, whose sum is σ = 41428569057308. Its totient is φ = 41428569057306.
The previous prime is 41428569057277. The next prime is 41428569057313. The reversal of 41428569057307 is 70375096582414.
41428569057307 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 41428569057307 - 215 = 41428569024539 is a prime.
It is not a weakly prime, because it can be changed into another prime (41428569757307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20714284528653 + 20714284528654.
It is an arithmetic number, because the mean of its divisors is an integer number (20714284528654).
It is a 1-persistent number, because it is pandigital, but 2⋅41428569057307 = 82857138114614 is not.
Almost surely, 241428569057307 is an apocalyptic number.
41428569057307 is a deficient number, since it is larger than the sum of its proper divisors (1).
41428569057307 is an equidigital number, since it uses as much as digits as its factorization.
41428569057307 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 50803200, while the sum is 61.
The spelling of 41428569057307 in words is "forty-one trillion, four hundred twenty-eight billion, five hundred sixty-nine million, fifty-seven thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •