Base | Representation |
---|---|
bin | 1000001100010101000… |
… | …10001101001100001001 |
3 | 222220121000110011110021 |
4 | 10012022202031030021 |
5 | 14103001224100334 |
6 | 333152403420441 |
7 | 26223521562544 |
oct | 4061242151411 |
9 | 886530404407 |
10 | 281497096969 |
11 | a9422855400 |
12 | 46680984721 |
13 | 2071166aa8a |
14 | d8a5a0585b |
15 | 74c80b73b4 |
hex | 418a88d309 |
281497096969 has 27 divisors (see below), whose sum is σ = 312556912941. Its totient is φ = 253333221240.
The previous prime is 281497096957. The next prime is 281497096999. The reversal of 281497096969 is 969690794182.
The square root of 281497096969 is 530563.
It is a perfect power (a square), and thus also a powerful number.
It is a de Polignac number, because none of the positive numbers 2k-281497096969 is a prime.
It is a super-2 number, since 2×2814970969692 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 281497096898 and 281497096907.
It is not an unprimeable number, because it can be changed into a prime (281497096949) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 811230654 + ... + 811231000.
Almost surely, 2281497096969 is an apocalyptic number.
281497096969 is the 530563-rd square number.
281497096969 is the 265282-nd centered octagonal number.
It is an amenable number.
281497096969 is a deficient number, since it is larger than the sum of its proper divisors (31059815972).
281497096969 is an frugal number, since it uses more digits than its factorization.
281497096969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 994 (or 497 counting only the distinct ones).
The product of its (nonzero) digits is 105815808, while the sum is 70.
The spelling of 281497096969 in words is "two hundred eighty-one billion, four hundred ninety-seven million, ninety-six thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •