Base | Representation |
---|---|
bin | 111100111100101101… |
… | …1010000000011110001 |
3 | 110111211200111011021110 |
4 | 1321321123100003301 |
5 | 4121023332040211 |
6 | 140043413343533 |
7 | 12312324251250 |
oct | 1717133200361 |
9 | 414750434243 |
10 | 130886205681 |
11 | 5056593a620 |
12 | 21449637ba9 |
13 | c45b67b5aa |
14 | 6499074797 |
15 | 3610a67ea6 |
hex | 1e796d00f1 |
130886205681 has 64 divisors (see below), whose sum is σ = 220192358400. Its totient is φ = 67180276800.
The previous prime is 130886205647. The next prime is 130886205701. The reversal of 130886205681 is 186502688031.
It is not a de Polignac number, because 130886205681 - 26 = 130886205617 is a prime.
It is a super-2 number, since 2×1308862056812 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 130886205681.
It is not an unprimeable number, because it can be changed into a prime (130886205641) 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 63 ways as a sum of consecutive naturals, for example, 6765340 + ... + 6784658.
It is an arithmetic number, because the mean of its divisors is an integer number (3440505600).
Almost surely, 2130886205681 is an apocalyptic number.
130886205681 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130886205681 is a deficient number, since it is larger than the sum of its proper divisors (89306152719).
130886205681 is a wasteful number, since it uses less digits than its factorization.
130886205681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19690.
The product of its (nonzero) digits is 552960, while the sum is 48.
The spelling of 130886205681 in words is "one hundred thirty billion, eight hundred eighty-six million, two hundred five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •