Base | Representation |
---|---|
bin | 11101101000011010111001… |
… | …101100000100010010100111 |
3 | 122002102120022110122221120012 |
4 | 131220122321230010102213 |
5 | 114040134413314011403 |
6 | 1141100351421200435 |
7 | 36310245122360315 |
oct | 3550327154042247 |
9 | 562376273587505 |
10 | 130321013032103 |
11 | 38584916438563 |
12 | 1274910370011b |
13 | 57942ac90c5aa |
14 | 24277dbd670b5 |
15 | 100ee368caed8 |
hex | 7686b9b044a7 |
130321013032103 has 2 divisors, whose sum is σ = 130321013032104. Its totient is φ = 130321013032102.
The previous prime is 130321013032033. The next prime is 130321013032109. The reversal of 130321013032103 is 301230310123031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130321013032103 - 212 = 130321013028007 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130321013032109) 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 as a sum of consecutive naturals, namely, 65160506516051 + 65160506516052.
It is an arithmetic number, because the mean of its divisors is an integer number (65160506516052).
Almost surely, 2130321013032103 is an apocalyptic number.
130321013032103 is a deficient number, since it is larger than the sum of its proper divisors (1).
130321013032103 is an equidigital number, since it uses as much as digits as its factorization.
130321013032103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 130321013032103 its reverse (301230310123031), we get a palindrome (431551323155134).
The spelling of 130321013032103 in words is "one hundred thirty trillion, three hundred twenty-one billion, thirteen million, thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •