Base | Representation |
---|---|
bin | 111100111101000100… |
… | …0010100101110111101 |
3 | 110111212111201110021022 |
4 | 1321322020110232331 |
5 | 4121034343140214 |
6 | 140044514513525 |
7 | 12312526552166 |
oct | 1717210245675 |
9 | 414774643238 |
10 | 130898021309 |
11 | 5057157a900 |
12 | 214515958a5 |
13 | c460c576a3 |
14 | 649a86c76d |
15 | 3611aedd8e |
hex | 1e7a214bbd |
130898021309 has 24 divisors (see below), whose sum is σ = 144459721560. Its totient is φ = 118519378560.
The previous prime is 130898021299. The next prime is 130898021321. The reversal of 130898021309 is 903120898031.
It can be written as a sum of positive squares in 4 ways, for example, as 70266346084 + 60631675225 = 265078^2 + 246235^2 .
It is not a de Polignac number, because 130898021309 - 220 = 130896972733 is a prime.
It is a super-2 number, since 2×1308980213092 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 130898021309.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130898021369) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 44996147 + ... + 44999055.
It is an arithmetic number, because the mean of its divisors is an integer number (6019155065).
Almost surely, 2130898021309 is an apocalyptic number.
It is an amenable number.
130898021309 is a deficient number, since it is larger than the sum of its proper divisors (13561700251).
130898021309 is a wasteful number, since it uses less digits than its factorization.
130898021309 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4301 (or 4290 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 44.
The spelling of 130898021309 in words is "one hundred thirty billion, eight hundred ninety-eight million, twenty-one thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •