Base | Representation |
---|---|
bin | 110001111100100110… |
… | …1011010001101111111 |
3 | 101020212011002121201201 |
4 | 1203321031122031333 |
5 | 3224132111212101 |
6 | 121135155320331 |
7 | 10515003066655 |
oct | 1437115321577 |
9 | 336764077651 |
10 | 107260257151 |
11 | 41541689823 |
12 | 189552b00a7 |
13 | a164a099a8 |
14 | 52973a6dd5 |
15 | 2bcb811e01 |
hex | 18f935a37f |
107260257151 has 2 divisors, whose sum is σ = 107260257152. Its totient is φ = 107260257150.
The previous prime is 107260257149. The next prime is 107260257217. The reversal of 107260257151 is 151752062701.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 107260257151 - 21 = 107260257149 is a prime.
Together with 107260257149, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 107260257151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107260257751) 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, 53630128575 + 53630128576.
It is an arithmetic number, because the mean of its divisors is an integer number (53630128576).
Almost surely, 2107260257151 is an apocalyptic number.
107260257151 is a deficient number, since it is larger than the sum of its proper divisors (1).
107260257151 is an equidigital number, since it uses as much as digits as its factorization.
107260257151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29400, while the sum is 37.
The spelling of 107260257151 in words is "one hundred seven billion, two hundred sixty million, two hundred fifty-seven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •