Base | Representation |
---|---|
bin | 11110110010100000010… |
… | …00100011011001111101 |
3 | 10202010122022111000122112 |
4 | 33121100020203121331 |
5 | 114313043012434034 |
6 | 2125555005023405 |
7 | 136300622545433 |
oct | 17312010433175 |
9 | 3663568430575 |
10 | 1057906374269 |
11 | 378723628a58 |
12 | 151042854b65 |
13 | 789b605a324 |
14 | 392bac2cd53 |
15 | 1c7ba2b07ce |
hex | f65022367d |
1057906374269 has 2 divisors, whose sum is σ = 1057906374270. Its totient is φ = 1057906374268.
The previous prime is 1057906374241. The next prime is 1057906374331. The reversal of 1057906374269 is 9624736097501.
1057906374269 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 590922751225 + 466983623044 = 768715^2 + 683362^2 .
It is a cyclic number.
It is not a de Polignac number, because 1057906374269 - 220 = 1057905325693 is a prime.
It is a super-2 number, since 2×10579063742692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1057906374229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528953187134 + 528953187135.
It is an arithmetic number, because the mean of its divisors is an integer number (528953187135).
Almost surely, 21057906374269 is an apocalyptic number.
It is an amenable number.
1057906374269 is a deficient number, since it is larger than the sum of its proper divisors (1).
1057906374269 is an equidigital number, since it uses as much as digits as its factorization.
1057906374269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17146080, while the sum is 59.
The spelling of 1057906374269 in words is "one trillion, fifty-seven billion, nine hundred six million, three hundred seventy-four thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •