Base | Representation |
---|---|
bin | 1110101110010100011… |
… | …0000000101011000001 |
3 | 220011220122011210011021 |
4 | 3223211012000223001 |
5 | 13121021111124444 |
6 | 312112051545441 |
7 | 24163243434100 |
oct | 3534506005301 |
9 | 804818153137 |
10 | 252951661249 |
11 | 98304689011 |
12 | 41034bbb281 |
13 | 1ab1274a201 |
14 | c358834037 |
15 | 68a7010584 |
hex | 3ae5180ac1 |
252951661249 has 9 divisors (see below), whose sum is σ = 294253987107. Its totient is φ = 216812691984.
The previous prime is 252951661231. The next prime is 252951661271. The reversal of 252951661249 is 942166159252.
The square root of 252951661249 is 502943.
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., 252599723649 + 351937600 = 502593^2 + 18760^2 .
It is not a de Polignac number, because 252951661249 - 219 = 252951136961 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 252951661196 and 252951661205.
It is not an unprimeable number, because it can be changed into a prime (252951661049) 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, 3484677 + ... + 3556525.
Almost surely, 2252951661249 is an apocalyptic number.
252951661249 is the 502943-rd square number.
252951661249 is the 251472-nd centered octagonal number.
It is an amenable number.
252951661249 is a deficient number, since it is larger than the sum of its proper divisors (41302325858).
252951661249 is an frugal number, since it uses more digits than its factorization.
252951661249 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143712 (or 71856 counting only the distinct ones).
The product of its digits is 2332800, while the sum is 52.
The spelling of 252951661249 in words is "two hundred fifty-two billion, nine hundred fifty-one million, six hundred sixty-one thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •