Base | Representation |
---|---|
bin | 101110100111011101… |
… | …0111101100100100001 |
3 | 100120101201110221020021 |
4 | 1131032322331210201 |
5 | 3120010212432301 |
6 | 113553352513441 |
7 | 10142530512151 |
oct | 1351672754441 |
9 | 316351427207 |
10 | 100108327201 |
11 | 395015a4a13 |
12 | 1749a0ab881 |
13 | 95950aa58c |
14 | 4bb95bc761 |
15 | 290d9d68a1 |
hex | 174eebd921 |
100108327201 has 9 divisors (see below), whose sum is σ = 101086848499. Its totient is φ = 99139197064.
The previous prime is 100108327199. The next prime is 100108327211. The reversal of 100108327201 is 102723801001.
It is a happy number.
The square root of 100108327201 is 316399.
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., 18611780625 + 81496546576 = 136425^2 + 285476^2 .
It is not a de Polignac number, because 100108327201 - 21 = 100108327199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100108327211) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 33853215 + ... + 33856171.
Almost surely, 2100108327201 is an apocalyptic number.
100108327201 is the 316399-th square number.
100108327201 is the 158200-th centered octagonal number.
It is an amenable number.
100108327201 is a deficient number, since it is larger than the sum of its proper divisors (978521298).
100108327201 is an frugal number, since it uses more digits than its factorization.
100108327201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6128 (or 3064 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 25.
Multiplying 100108327201 by its sum of digits (25), we get a square (2502708180025 = 15819952).
The spelling of 100108327201 in words is "one hundred billion, one hundred eight million, three hundred twenty-seven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •