Base | Representation |
---|---|
bin | 111100111111000101… |
… | …0111101000100010000 |
3 | 110112001020021222010111 |
4 | 1321332022331010100 |
5 | 4121204222212124 |
6 | 140055340011104 |
7 | 12314312046061 |
oct | 1717612750420 |
9 | 415036258114 |
10 | 130965819664 |
11 | 505a68777a9 |
12 | 21470230a94 |
13 | c472005064 |
14 | 64a587a568 |
15 | 3617a42494 |
hex | 1e7e2bd110 |
130965819664 has 15 divisors (see below), whose sum is σ = 253749080293. Its totient is φ = 65482186048.
The previous prime is 130965819641. The next prime is 130965819667. The reversal of 130965819664 is 466918569031.
It is a happy number.
The square root of 130965819664 is 361892.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 105560010000 + 25405809664 = 324900^2 + 159392^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130965819599 and 130965819608.
It is not an unprimeable number, because it can be changed into a prime (130965819667) by changing a digit.
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 2 ways as a sum of consecutive naturals, for example, 1402332 + ... + 1492804.
Almost surely, 2130965819664 is an apocalyptic number.
130965819664 is the 361892-nd square number.
It is an amenable number.
130965819664 is a deficient number, since it is larger than the sum of its proper divisors (122783260629).
130965819664 is an frugal number, since it uses more digits than its factorization.
130965819664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180954 (or 90475 counting only the distinct ones).
The product of its (nonzero) digits is 8398080, while the sum is 58.
The spelling of 130965819664 in words is "one hundred thirty billion, nine hundred sixty-five million, eight hundred nineteen thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •