Base | Representation |
---|---|
bin | 1111100010101… |
… | …11111001000111 |
3 | 100002100011102222 |
4 | 13301113321013 |
5 | 231334232211 |
6 | 20534322555 |
7 | 3142145423 |
oct | 761277107 |
9 | 302304388 |
10 | 130383431 |
11 | 67664002 |
12 | 377b945b |
13 | 21021179 |
14 | 1345db83 |
15 | b6a71db |
hex | 7c57e47 |
130383431 has 2 divisors, whose sum is σ = 130383432. Its totient is φ = 130383430.
The previous prime is 130383419. The next prime is 130383437. The reversal of 130383431 is 134383031.
It is a strong prime.
It is an emirp because it is prime and its reverse (134383031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130383431 - 26 = 130383367 is a prime.
It is a super-4 number, since 4×1303834314 (a number of 34 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130383431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130383437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65191715 + 65191716.
It is an arithmetic number, because the mean of its divisors is an integer number (65191716).
Almost surely, 2130383431 is an apocalyptic number.
130383431 is a deficient number, since it is larger than the sum of its proper divisors (1).
130383431 is an equidigital number, since it uses as much as digits as its factorization.
130383431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
The square root of 130383431 is about 11418.5564324042. The cubic root of 130383431 is about 507.0772601339.
The spelling of 130383431 in words is "one hundred thirty million, three hundred eighty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •