Base | Representation |
---|---|
bin | 101110110001000010… |
… | …0111110001101101001 |
3 | 100121020010020022001011 |
4 | 1131202010332031221 |
5 | 3121140001442002 |
6 | 114045313223521 |
7 | 10153512343522 |
oct | 1354204761551 |
9 | 317203208034 |
10 | 100429718377 |
11 | 39656a5995a |
12 | 17569861ba1 |
13 | 9616857a81 |
14 | 4c0a15d849 |
15 | 292bd1d8d7 |
hex | 176213e369 |
100429718377 has 2 divisors, whose sum is σ = 100429718378. Its totient is φ = 100429718376.
The previous prime is 100429718359. The next prime is 100429718413. The reversal of 100429718377 is 773817924001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92739129961 + 7690588416 = 304531^2 + 87696^2 .
It is a cyclic number.
It is not a de Polignac number, because 100429718377 - 211 = 100429716329 is a prime.
It is a super-2 number, since 2×1004297183772 (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 100429718377.
It is not a weakly prime, because it can be changed into another prime (100429718317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50214859188 + 50214859189.
It is an arithmetic number, because the mean of its divisors is an integer number (50214859189).
Almost surely, 2100429718377 is an apocalyptic number.
It is an amenable number.
100429718377 is a deficient number, since it is larger than the sum of its proper divisors (1).
100429718377 is an equidigital number, since it uses as much as digits as its factorization.
100429718377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 592704, while the sum is 49.
The spelling of 100429718377 in words is "one hundred billion, four hundred twenty-nine million, seven hundred eighteen thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •