Base | Representation |
---|---|
bin | 110010011010101101… |
… | …1100110111000111001 |
3 | 101100110120020222001121 |
4 | 1210311123212320321 |
5 | 3233214234041100 |
6 | 121423330545241 |
7 | 10552022006002 |
oct | 1446533467071 |
9 | 340416228047 |
10 | 108270612025 |
11 | 41a0aa35354 |
12 | 18b97738221 |
13 | a296131104 |
14 | 535164c1a9 |
15 | 2c3a38b51a |
hex | 19356e6e39 |
108270612025 has 9 divisors (see below), whose sum is σ = 134257599021. Its totient is φ = 86615173440.
The previous prime is 108270611983. The next prime is 108270612029. The reversal of 108270612025 is 520216072801.
It is a happy number.
The square root of 108270612025 is 329045.
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 18388173609 + 89882438416 = 135603^2 + 299804^2 .
It is not a de Polignac number, because 108270612025 - 235 = 73910873657 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (108270612029) 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, 1612321 + ... + 1678129.
Almost surely, 2108270612025 is an apocalyptic number.
108270612025 is the 329045-th square number.
108270612025 is the 164523-rd centered octagonal number.
It is an amenable number.
108270612025 is a deficient number, since it is larger than the sum of its proper divisors (25986986996).
108270612025 is an frugal number, since it uses more digits than its factorization.
108270612025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131628 (or 65814 counting only the distinct ones).
The product of its (nonzero) digits is 13440, while the sum is 34.
Adding to 108270612025 its reverse (520216072801), we get a palindrome (628486684826).
The spelling of 108270612025 in words is "one hundred eight billion, two hundred seventy million, six hundred twelve thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •