Base | Representation |
---|---|
bin | 111100111011001000… |
… | …1101100000110110100 |
3 | 110111201000001200212220 |
4 | 1321312101230012310 |
5 | 4120421320224401 |
6 | 140034245042340 |
7 | 12311113163100 |
oct | 1716621540664 |
9 | 414630050786 |
10 | 130833367476 |
11 | 50539030489 |
12 | 214339b63b0 |
13 | c45073b396 |
14 | 649203c900 |
15 | 360b0cc336 |
hex | 1e7646c1b4 |
130833367476 has 288 divisors, whose sum is σ = 368227689984. Its totient is φ = 36036000000.
The previous prime is 130833367453. The next prime is 130833367519. The reversal of 130833367476 is 674763338031.
It is a super-2 number, since 2×1308333674762 (a number of 23 digits) contains 22 as substring.
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 95 ways as a sum of consecutive naturals, for example, 521248351 + ... + 521248601.
It is an arithmetic number, because the mean of its divisors is an integer number (1278568368).
Almost surely, 2130833367476 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130833367476, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184113844992).
130833367476 is an abundant number, since it is smaller than the sum of its proper divisors (237394322508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130833367476 is a wasteful number, since it uses less digits than its factorization.
130833367476 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 571 (or 562 counting only the distinct ones).
The product of its (nonzero) digits is 4572288, while the sum is 51.
The spelling of 130833367476 in words is "one hundred thirty billion, eight hundred thirty-three million, three hundred sixty-seven thousand, four hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •