Base | Representation |
---|---|
bin | 1000010111000110101… |
… | …10000110101100101001 |
3 | 1000110112011212221120201 |
4 | 10023203112012230221 |
5 | 14201323202023134 |
6 | 335550415352201 |
7 | 26520055153252 |
oct | 4134326065451 |
9 | 1013464787521 |
10 | 287282064169 |
11 | 100921265931 |
12 | 47816222661 |
13 | 21124017ca9 |
14 | dc9403bb29 |
15 | 7715dc6914 |
hex | 42e3586b29 |
287282064169 has 9 divisors (see below), whose sum is σ = 288277607863. Its totient is φ = 286289952232.
The previous prime is 287282064109. The next prime is 287282064221. The reversal of 287282064169 is 961460282782.
The square root of 287282064169 is 535987.
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., 250805648025 + 36476416144 = 500805^2 + 190988^2 .
It is not a de Polignac number, because 287282064169 - 227 = 287147846441 is a prime.
It is a super-2 number, since 2×2872820641692 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (287282064109) 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, 192418587 + ... + 192420079.
Almost surely, 2287282064169 is an apocalyptic number.
287282064169 is the 535987-th square number.
287282064169 is the 267994-th centered octagonal number.
It is an amenable number.
287282064169 is a deficient number, since it is larger than the sum of its proper divisors (995543694).
287282064169 is an frugal number, since it uses more digits than its factorization.
287282064169 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3704 (or 1852 counting only the distinct ones).
The product of its (nonzero) digits is 4644864, while the sum is 55.
The spelling of 287282064169 in words is "two hundred eighty-seven billion, two hundred eighty-two million, sixty-four thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •