Base | Representation |
---|---|
bin | 1000000000110111111… |
… | …00110000110010000001 |
3 | 222022201101121201211201 |
4 | 10000123330300302001 |
5 | 14002402241221400 |
6 | 330254221541201 |
7 | 25615231232551 |
oct | 4003374606201 |
9 | 868641551751 |
10 | 275346820225 |
11 | a6857113464 |
12 | 45445114801 |
13 | 1cc71407179 |
14 | d480c79161 |
15 | 726819806a |
hex | 401bf30c81 |
275346820225 has 9 divisors (see below), whose sum is σ = 341433310467. Its totient is φ = 220275357240.
The previous prime is 275346820183. The next prime is 275346820247. The reversal of 275346820225 is 522028643572.
The square root of 275346820225 is 524735.
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., 99124855281 + 176221964944 = 314841^2 + 419788^2 .
It is not a de Polignac number, because 275346820225 - 213 = 275346812033 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2571202 + ... + 2676148.
Almost surely, 2275346820225 is an apocalyptic number.
275346820225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
275346820225 is the 524735-th square number.
275346820225 is the 262368-th centered octagonal number.
It is an amenable number.
275346820225 is a deficient number, since it is larger than the sum of its proper divisors (66086490242).
275346820225 is an frugal number, since it uses more digits than its factorization.
275346820225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209904 (or 104952 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 46.
The spelling of 275346820225 in words is "two hundred seventy-five billion, three hundred forty-six million, eight hundred twenty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •