Base | Representation |
---|---|
bin | 111100111110111000… |
… | …1111001100011001101 |
3 | 110112000202221021112010 |
4 | 1321331301321203031 |
5 | 4121201032023121 |
6 | 140054543131433 |
7 | 12314202162300 |
oct | 1717561714315 |
9 | 415022837463 |
10 | 130959251661 |
11 | 505a30a10a7 |
12 | 21469ba3b79 |
13 | c470845674 |
14 | 64a4a4ab37 |
15 | 3617196376 |
hex | 1e7dc798cd |
130959251661 has 24 divisors (see below), whose sum is σ = 211951802304. Its totient is φ = 71580210240.
The previous prime is 130959251653. The next prime is 130959251701. The reversal of 130959251661 is 166152959031.
It is not a de Polignac number, because 130959251661 - 23 = 130959251653 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 130959251661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130959251651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19363560 + ... + 19370321.
It is an arithmetic number, because the mean of its divisors is an integer number (8831325096).
Almost surely, 2130959251661 is an apocalyptic number.
It is an amenable number.
130959251661 is a deficient number, since it is larger than the sum of its proper divisors (80992550643).
130959251661 is a wasteful number, since it uses less digits than its factorization.
130959251661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38733921 (or 38733914 counting only the distinct ones).
The product of its (nonzero) digits is 437400, while the sum is 48.
The spelling of 130959251661 in words is "one hundred thirty billion, nine hundred fifty-nine million, two hundred fifty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •