Base | Representation |
---|---|
bin | 11101110001111000011000… |
… | …111000111100100000000001 |
3 | 122011201201102122122101002001 |
4 | 131301320120320330200001 |
5 | 114131312403434232111 |
6 | 1142315152115224001 |
7 | 36405232125123406 |
oct | 3561703070744001 |
9 | 564651378571061 |
10 | 130971150305281 |
11 | 38805609a33510 |
12 | 128331052a8001 |
13 | 58106ac8a0940 |
14 | 244b074c722ad |
15 | 1021cd81a71c1 |
hex | 771e18e3c801 |
130971150305281 has 32 divisors (see below), whose sum is σ = 154011056008320. Its totient is φ = 109803865075200.
The previous prime is 130971150305273. The next prime is 130971150305327. The reversal of 130971150305281 is 182503051179031.
It is a cyclic number.
It is not a de Polignac number, because 130971150305281 - 23 = 130971150305273 is a prime.
It is a super-2 number, since 2×1309711503052812 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130971150305881) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 781399621 + ... + 781567213.
It is an arithmetic number, because the mean of its divisors is an integer number (4812845500260).
Almost surely, 2130971150305281 is an apocalyptic number.
130971150305281 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130971150305281 is a deficient number, since it is larger than the sum of its proper divisors (23039905703039).
130971150305281 is a wasteful number, since it uses less digits than its factorization.
130971150305281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172657.
The product of its (nonzero) digits is 226800, while the sum is 46.
The spelling of 130971150305281 in words is "one hundred thirty trillion, nine hundred seventy-one billion, one hundred fifty million, three hundred five thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •