Base | Representation |
---|---|
bin | 110010011110011110… |
… | …1101111110110111001 |
3 | 101100210101002020202001 |
4 | 1210330331233312321 |
5 | 3233444113032134 |
6 | 121444043541001 |
7 | 10555115213251 |
oct | 1447475576671 |
9 | 340711066661 |
10 | 108397002169 |
11 | 41a75311115 |
12 | 19011b2a761 |
13 | a2b6384791 |
14 | 536434c961 |
15 | 2c46505414 |
hex | 193cf6fdb9 |
108397002169 has 9 divisors (see below), whose sum is σ = 112273609773. Its totient is φ = 104649955872.
The previous prime is 108397002167. The next prime is 108397002229. The reversal of 108397002169 is 961200793801.
It is a happy number.
The square root of 108397002169 is 329237.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 4705274025 + 103691728144 = 68595^2 + 322012^2 .
It is not a de Polignac number, because 108397002169 - 21 = 108397002167 is a prime.
It is a super-2 number, since 2×1083970021692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (108397002167) 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, 9542197 + ... + 9553549.
Almost surely, 2108397002169 is an apocalyptic number.
108397002169 is the 329237-th square number.
108397002169 is the 164619-th centered octagonal number.
It is an amenable number.
108397002169 is a deficient number, since it is larger than the sum of its proper divisors (3876607604).
108397002169 is an frugal number, since it uses more digits than its factorization.
108397002169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22764 (or 11382 counting only the distinct ones).
The product of its (nonzero) digits is 163296, while the sum is 46.
The spelling of 108397002169 in words is "one hundred eight billion, three hundred ninety-seven million, two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •