Base | Representation |
---|---|
bin | 11101100110110101101010… |
… | …011111010011010111101011 |
3 | 122002001011201202221000200122 |
4 | 131212311222133103113223 |
5 | 114031344302341303111 |
6 | 1140534413124153455 |
7 | 36266346300622235 |
oct | 3546655237232753 |
9 | 562034652830618 |
10 | 130212310103531 |
11 | 38542804475407 |
12 | 1273002723888b |
13 | 5786c78063696 |
14 | 2422449141255 |
15 | 100c1c35e5cdb |
hex | 766d6a7d35eb |
130212310103531 has 2 divisors, whose sum is σ = 130212310103532. Its totient is φ = 130212310103530.
The previous prime is 130212310103509. The next prime is 130212310103633. The reversal of 130212310103531 is 135301013212031.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130212310103531 is a prime.
It is a super-2 number, since 2×1302123101035312 (a number of 29 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 130212310103531.
It is not a weakly prime, because it can be changed into another prime (130212310183531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65106155051765 + 65106155051766.
It is an arithmetic number, because the mean of its divisors is an integer number (65106155051766).
Almost surely, 2130212310103531 is an apocalyptic number.
130212310103531 is a deficient number, since it is larger than the sum of its proper divisors (1).
130212310103531 is an equidigital number, since it uses as much as digits as its factorization.
130212310103531 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1620, while the sum is 26.
Adding to 130212310103531 its reverse (135301013212031), we get a palindrome (265513323315562).
The spelling of 130212310103531 in words is "one hundred thirty trillion, two hundred twelve billion, three hundred ten million, one hundred three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •