Base | Representation |
---|---|
bin | 1110100001111001110… |
… | …1011110000111001001 |
3 | 212212022101110102111111 |
4 | 3220132131132013021 |
5 | 13042210000121121 |
6 | 310401244330321 |
7 | 24014536503541 |
oct | 3503635360711 |
9 | 785271412444 |
10 | 249619145161 |
11 | 96954555391 |
12 | 40464b439a1 |
13 | 1a7011c18b9 |
14 | c11ddd2321 |
15 | 675e6882e1 |
hex | 3a1e75e1c9 |
249619145161 has 9 divisors (see below), whose sum is σ = 253434396999. Its totient is φ = 245860511424.
The previous prime is 249619145147. The next prime is 249619145179. The reversal of 249619145161 is 161541916942.
The square root of 249619145161 is 499619.
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., 75276153225 + 174342991936 = 274365^2 + 417544^2 .
It is not a de Polignac number, because 249619145161 - 229 = 249082274249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (249619145561) 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, 33470745 + ... + 33478201.
Almost surely, 2249619145161 is an apocalyptic number.
249619145161 is the 499619-th square number.
249619145161 is the 249810-th centered octagonal number.
It is an amenable number.
249619145161 is a deficient number, since it is larger than the sum of its proper divisors (3815251838).
249619145161 is an frugal number, since it uses more digits than its factorization.
249619145161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15048 (or 7524 counting only the distinct ones).
The product of its digits is 466560, while the sum is 49.
Multiplying 249619145161 by its sum of digits (49), we get a square (12231338112889 = 34973332).
The spelling of 249619145161 in words is "two hundred forty-nine billion, six hundred nineteen million, one hundred forty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •