Base | Representation |
---|---|
bin | 111100101011100110… |
… | …1001101100011110001 |
3 | 110110100200012120110002 |
4 | 1321113031031203301 |
5 | 4113334344200311 |
6 | 135510424315345 |
7 | 12262153401062 |
oct | 1712715154361 |
9 | 413320176402 |
10 | 130312100081 |
11 | 502a0868589 |
12 | 21309312b55 |
13 | c39974b037 |
14 | 6442b0c569 |
15 | 35ca46293b |
hex | 1e5734d8f1 |
130312100081 has 2 divisors, whose sum is σ = 130312100082. Its totient is φ = 130312100080.
The previous prime is 130312100071. The next prime is 130312100137. The reversal of 130312100081 is 180001213031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73628109025 + 56683991056 = 271345^2 + 238084^2 .
It is a cyclic number.
It is not a de Polignac number, because 130312100081 - 214 = 130312083697 is a prime.
It is a super-2 number, since 2×1303121000812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (130312100071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65156050040 + 65156050041.
It is an arithmetic number, because the mean of its divisors is an integer number (65156050041).
Almost surely, 2130312100081 is an apocalyptic number.
It is an amenable number.
130312100081 is a deficient number, since it is larger than the sum of its proper divisors (1).
130312100081 is an equidigital number, since it uses as much as digits as its factorization.
130312100081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
It can be divided in two parts, 13031 and 2100081, that added together give a palindrome (2113112).
The spelling of 130312100081 in words is "one hundred thirty billion, three hundred twelve million, one hundred thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •