Base | Representation |
---|---|
bin | 11110110001011011001… |
… | …00101010110100011011 |
3 | 10202002010220102111110021 |
4 | 33120231210222310123 |
5 | 114310401043321412 |
6 | 2125421253131311 |
7 | 136250352214603 |
oct | 17305544526433 |
9 | 3662126374407 |
10 | 1057326542107 |
11 | 3784562a5520 |
12 | 150b00629b37 |
13 | 78922ba3384 |
14 | 39263c15c03 |
15 | 1c784428607 |
hex | f62d92ad1b |
1057326542107 has 4 divisors (see below), whose sum is σ = 1153447136856. Its totient is φ = 961205947360.
The previous prime is 1057326542101. The next prime is 1057326542113. The reversal of 1057326542107 is 7012456237501.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (1057326542101) and next prime (1057326542113).
It is a cyclic number.
It is not a de Polignac number, because 1057326542107 - 223 = 1057318153499 is a prime.
It is a super-2 number, since 2×10573265421072 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1057326542101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 48060297358 + ... + 48060297379.
It is an arithmetic number, because the mean of its divisors is an integer number (288361784214).
Almost surely, 21057326542107 is an apocalyptic number.
1057326542107 is a deficient number, since it is larger than the sum of its proper divisors (96120594749).
1057326542107 is an equidigital number, since it uses as much as digits as its factorization.
1057326542107 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96120594748.
The product of its (nonzero) digits is 352800, while the sum is 43.
The spelling of 1057326542107 in words is "one trillion, fifty-seven billion, three hundred twenty-six million, five hundred forty-two thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •