Base | Representation |
---|---|
bin | 1111100000101… |
… | …10010111101101 |
3 | 100001211112022001 |
4 | 13300112113231 |
5 | 231302140203 |
6 | 20524452301 |
7 | 3136650115 |
oct | 760262755 |
9 | 301745261 |
10 | 130115053 |
11 | 674a0402 |
12 | 376aa091 |
13 | 20c58c73 |
14 | 133d0045 |
15 | b65291d |
hex | 7c165ed |
130115053 has 4 divisors (see below), whose sum is σ = 132570108. Its totient is φ = 127660000.
The previous prime is 130115023. The next prime is 130115077. The reversal of 130115053 is 350511031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 116704809 + 13410244 = 10803^2 + 3662^2 .
It is a cyclic number.
It is not a de Polignac number, because 130115053 - 29 = 130114541 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130115053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130115023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1227448 + ... + 1227553.
It is an arithmetic number, because the mean of its divisors is an integer number (33142527).
Almost surely, 2130115053 is an apocalyptic number.
It is an amenable number.
130115053 is a deficient number, since it is larger than the sum of its proper divisors (2455055).
130115053 is an equidigital number, since it uses as much as digits as its factorization.
130115053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2455054.
The product of its (nonzero) digits is 225, while the sum is 19.
The square root of 130115053 is about 11406.7985429743. The cubic root of 130115053 is about 506.7291027532.
Adding to 130115053 its reverse (350511031), we get a palindrome (480626084).
The spelling of 130115053 in words is "one hundred thirty million, one hundred fifteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •