Base | Representation |
---|---|
bin | 11101100110001011001101… |
… | …110111011011010011111001 |
3 | 122001212211002102001122021220 |
4 | 131212023031313123103321 |
5 | 114030122432034403031 |
6 | 1140501434351022253 |
7 | 36263143660431054 |
oct | 3546131567332371 |
9 | 561784072048256 |
10 | 130166732731641 |
11 | 38525446207311 |
12 | 1272322750a989 |
13 | 578289364a388 |
14 | 2420163d39a9b |
15 | 100ae07159596 |
hex | 7662cdddb4f9 |
130166732731641 has 48 divisors (see below), whose sum is σ = 196459381467648. Its totient is φ = 76313152742400.
The previous prime is 130166732731627. The next prime is 130166732731661. The reversal of 130166732731641 is 146137237661031.
It is not a de Polignac number, because 130166732731641 - 27 = 130166732731513 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (130166732731661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 47619190 + ... + 50278431.
It is an arithmetic number, because the mean of its divisors is an integer number (4092903780576).
Almost surely, 2130166732731641 is an apocalyptic number.
It is an amenable number.
130166732731641 is a deficient number, since it is larger than the sum of its proper divisors (66292648736007).
130166732731641 is a wasteful number, since it uses less digits than its factorization.
130166732731641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97897730 (or 97897701 counting only the distinct ones).
The product of its (nonzero) digits is 2286144, while the sum is 51.
The spelling of 130166732731641 in words is "one hundred thirty trillion, one hundred sixty-six billion, seven hundred thirty-two million, seven hundred thirty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •