Base | Representation |
---|---|
bin | 1010000011111000000100… |
… | …0101010110011111110011 |
3 | 1110011111012100020011122222 |
4 | 2200332001011112133303 |
5 | 2422213333322412211 |
6 | 35305402222551255 |
7 | 2221116253311533 |
oct | 240760105263763 |
9 | 43144170204588 |
10 | 11061706450931 |
11 | 3585274a058a4 |
12 | 12a79bb13852b |
13 | 623164578b06 |
14 | 2a356490d4c3 |
15 | 142b18b371db |
hex | a0f811567f3 |
11061706450931 has 2 divisors, whose sum is σ = 11061706450932. Its totient is φ = 11061706450930.
The previous prime is 11061706450913. The next prime is 11061706450979. The reversal of 11061706450931 is 13905460716011.
11061706450931 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (11061706450913) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11061706450931 - 226 = 11061639342067 is a prime.
It is a super-2 number, since 2×110617064509312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11061706450901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5530853225465 + 5530853225466.
It is an arithmetic number, because the mean of its divisors is an integer number (5530853225466).
Almost surely, 211061706450931 is an apocalyptic number.
11061706450931 is a deficient number, since it is larger than the sum of its proper divisors (1).
11061706450931 is an equidigital number, since it uses as much as digits as its factorization.
11061706450931 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 136080, while the sum is 44.
The spelling of 11061706450931 in words is "eleven trillion, sixty-one billion, seven hundred six million, four hundred fifty thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •