Base | Representation |
---|---|
bin | 111100101111101011… |
… | …1110100011000000000 |
3 | 110110201012222210120222 |
4 | 1321133113310120000 |
5 | 4114124432120430 |
6 | 135532200522212 |
7 | 12265436016446 |
oct | 1713727643000 |
9 | 413635883528 |
10 | 130449098240 |
11 | 5036112a2aa |
12 | 21347180368 |
13 | c3bbc46c36 |
14 | 6456db0b96 |
15 | 35d74c49e5 |
hex | 1e5f5f4600 |
130449098240 has 40 divisors (see below), whose sum is σ = 312772101840. Its totient is φ = 52179638272.
The previous prime is 130449098203. The next prime is 130449098261. The reversal of 130449098240 is 42890944031.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 130449098191 and 130449098200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25475780 + ... + 25480899.
It is an arithmetic number, because the mean of its divisors is an integer number (7819302546).
Almost surely, 2130449098240 is an apocalyptic number.
130449098240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130449098240 is an abundant number, since it is smaller than the sum of its proper divisors (182323003600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130449098240 is an frugal number, since it uses more digits than its factorization.
130449098240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50956702 (or 50956686 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 44.
The spelling of 130449098240 in words is "one hundred thirty billion, four hundred forty-nine million, ninety-eight thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •