Base | Representation |
---|---|
bin | 1111100000001… |
… | …11100010000001 |
3 | 100001201102220221 |
4 | 13300013202001 |
5 | 231243214043 |
6 | 20523303041 |
7 | 3136304656 |
oct | 760074201 |
9 | 301642827 |
10 | 130054273 |
11 | 67459778 |
12 | 3767aa81 |
13 | 20c373bb |
14 | 133b5c2d |
15 | b63e8ed |
hex | 7c07881 |
130054273 has 2 divisors, whose sum is σ = 130054274. Its totient is φ = 130054272.
The previous prime is 130054271. The next prime is 130054313. The reversal of 130054273 is 372450031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 90402064 + 39652209 = 9508^2 + 6297^2 .
It is an emirp because it is prime and its reverse (372450031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130054273 - 21 = 130054271 is a prime.
It is a super-2 number, since 2×1300542732 = 33828227851117058, which contains 22 as substring.
Together with 130054271, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (130054271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65027136 + 65027137.
It is an arithmetic number, because the mean of its divisors is an integer number (65027137).
Almost surely, 2130054273 is an apocalyptic number.
It is an amenable number.
130054273 is a deficient number, since it is larger than the sum of its proper divisors (1).
130054273 is an equidigital number, since it uses as much as digits as its factorization.
130054273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 25.
The square root of 130054273 is about 11404.1340311310. The cubic root of 130054273 is about 506.6501885126.
The spelling of 130054273 in words is "one hundred thirty million, fifty-four thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •