Base | Representation |
---|---|
bin | 111100100110100100… |
… | …0100100100010010001 |
3 | 110102220220020001102211 |
4 | 1321031020210202101 |
5 | 4113013114030223 |
6 | 135441550312121 |
7 | 12255032123335 |
oct | 1711510444221 |
9 | 412826201384 |
10 | 130143111313 |
11 | 50214436846 |
12 | 212807b8641 |
13 | c370731097 |
14 | 64284bd7c5 |
15 | 35ba6d1d0d |
hex | 1e4d224891 |
130143111313 has 2 divisors, whose sum is σ = 130143111314. Its totient is φ = 130143111312.
The previous prime is 130143111281. The next prime is 130143111347. The reversal of 130143111313 is 313111341031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80782713729 + 49360397584 = 284223^2 + 222172^2 .
It is an emirp because it is prime and its reverse (313111341031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130143111313 - 25 = 130143111281 is a prime.
It is not a weakly prime, because it can be changed into another prime (130143121313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65071555656 + 65071555657.
It is an arithmetic number, because the mean of its divisors is an integer number (65071555657).
Almost surely, 2130143111313 is an apocalyptic number.
It is an amenable number.
130143111313 is a deficient number, since it is larger than the sum of its proper divisors (1).
130143111313 is an equidigital number, since it uses as much as digits as its factorization.
130143111313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 130143111313 its reverse (313111341031), we get a palindrome (443254452344).
The spelling of 130143111313 in words is "one hundred thirty billion, one hundred forty-three million, one hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •