Base | Representation |
---|---|
bin | 111100101011100011… |
… | …1010100000110110001 |
3 | 110110100120022000200001 |
4 | 1321113013110012301 |
5 | 4113334000212113 |
6 | 135510331230001 |
7 | 12262134301462 |
oct | 1712707240661 |
9 | 413316260601 |
10 | 130310554033 |
11 | 5029aa01a60 |
12 | 213088a8301 |
13 | c39932940a |
14 | 6442828d69 |
15 | 35ca2597dd |
hex | 1e571d41b1 |
130310554033 has 8 divisors (see below), whose sum is σ = 142159758336. Its totient is φ = 118461814800.
The previous prime is 130310553979. The next prime is 130310554039. The reversal of 130310554033 is 330455013031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130310554033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130310553992 and 130310554010.
It is not an unprimeable number, because it can be changed into a prime (130310554039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 750735 + ... + 907867.
It is an arithmetic number, because the mean of its divisors is an integer number (17769969792).
Almost surely, 2130310554033 is an apocalyptic number.
It is an amenable number.
130310554033 is a deficient number, since it is larger than the sum of its proper divisors (11849204303).
130310554033 is a wasteful number, since it uses less digits than its factorization.
130310554033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232535.
The product of its (nonzero) digits is 8100, while the sum is 28.
Adding to 130310554033 its reverse (330455013031), we get a palindrome (460765567064).
The spelling of 130310554033 in words is "one hundred thirty billion, three hundred ten million, five hundred fifty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •