Base | Representation |
---|---|
bin | 101110110100100100… |
… | …0000100011001011001 |
3 | 100121112100202010122221 |
4 | 1131221020010121121 |
5 | 3121410240030044 |
6 | 114105135544041 |
7 | 10156446435400 |
oct | 1355110043131 |
9 | 317470663587 |
10 | 100547970649 |
11 | 39707787605 |
12 | 175a138b021 |
13 | 96351bc329 |
14 | 4c1bb42637 |
15 | 29373cb484 |
hex | 1769204659 |
100547970649 has 27 divisors (see below), whose sum is σ = 118435819743. Its totient is φ = 85112834688.
The previous prime is 100547970647. The next prime is 100547970701. The reversal of 100547970649 is 946079745001.
The square root of 100547970649 is 317093.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 45149875225 + 55398095424 = 212485^2 + 235368^2 .
It is not a de Polignac number, because 100547970649 - 21 = 100547970647 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100547970596 and 100547970605.
It is not an unprimeable number, because it can be changed into a prime (100547970647) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 215305914 + ... + 215306380.
Almost surely, 2100547970649 is an apocalyptic number.
100547970649 is the 317093-rd square number.
100547970649 is the 158547-th centered octagonal number.
It is an amenable number.
100547970649 is a deficient number, since it is larger than the sum of its proper divisors (17887849094).
100547970649 is an frugal number, since it uses more digits than its factorization.
100547970649 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1142 (or 571 counting only the distinct ones).
The product of its (nonzero) digits is 1905120, while the sum is 52.
The spelling of 100547970649 in words is "one hundred billion, five hundred forty-seven million, nine hundred seventy thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •