Base | Representation |
---|---|
bin | 101111111011010010… |
… | …0011000100111101001 |
3 | 100211122201222112212001 |
4 | 1133312210120213221 |
5 | 3141240232342334 |
6 | 115140425451001 |
7 | 10302322622002 |
oct | 1376644304751 |
9 | 324581875761 |
10 | 102920980969 |
11 | 3a715235364 |
12 | 17b44040a61 |
13 | 9922a18251 |
14 | 4da4d781a9 |
15 | 2a258c0714 |
hex | 17f69189e9 |
102920980969 has 9 divisors (see below), whose sum is σ = 103285749189. Its totient is φ = 102557499840.
The previous prime is 102920980963. The next prime is 102920980979. The reversal of 102920980969 is 969089029201.
The square root of 102920980969 is 320813.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 16040025 + 102904940944 = 4005^2 + 320788^2 .
It is not a de Polignac number, because 102920980969 - 23 = 102920980961 is a prime.
It is a super-2 number, since 2×1029209809692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102920980961) 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, 173559537 + ... + 173560129.
Almost surely, 2102920980969 is an apocalyptic number.
102920980969 is the 320813-rd square number.
102920980969 is the 160407-th centered octagonal number.
It is an amenable number.
102920980969 is a deficient number, since it is larger than the sum of its proper divisors (364768220).
102920980969 is an frugal number, since it uses more digits than its factorization.
102920980969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2268 (or 1134 counting only the distinct ones).
The product of its (nonzero) digits is 1259712, while the sum is 55.
The spelling of 102920980969 in words is "one hundred two billion, nine hundred twenty million, nine hundred eighty thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •