Base | Representation |
---|---|
bin | 110001100011111000… |
… | …1000011101001000001 |
3 | 101011201100012211120102 |
4 | 1203013301003221001 |
5 | 3220432232203212 |
6 | 120521004052145 |
7 | 10455311241464 |
oct | 1430761035101 |
9 | 334640184512 |
10 | 106430741057 |
11 | 41156419033 |
12 | 18763534055 |
13 | a061bc1174 |
14 | 52191572db |
15 | 2b7daa95c2 |
hex | 18c7c43a41 |
106430741057 has 2 divisors, whose sum is σ = 106430741058. Its totient is φ = 106430741056.
The previous prime is 106430741023. The next prime is 106430741063. The reversal of 106430741057 is 750147034601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101333352241 + 5097388816 = 318329^2 + 71396^2 .
It is a cyclic number.
It is not a de Polignac number, because 106430741057 - 210 = 106430740033 is a prime.
It is a super-2 number, since 2×1064307410572 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106430741057.
It is not a weakly prime, because it can be changed into another prime (106430741957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53215370528 + 53215370529.
It is an arithmetic number, because the mean of its divisors is an integer number (53215370529).
Almost surely, 2106430741057 is an apocalyptic number.
It is an amenable number.
106430741057 is a deficient number, since it is larger than the sum of its proper divisors (1).
106430741057 is an equidigital number, since it uses as much as digits as its factorization.
106430741057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 70560, while the sum is 38.
Adding to 106430741057 its reverse (750147034601), we get a palindrome (856577775658).
The spelling of 106430741057 in words is "one hundred six billion, four hundred thirty million, seven hundred forty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •