Base | Representation |
---|---|
bin | 111100101011101001… |
… | …0101111100011010001 |
3 | 110110100202221020102000 |
4 | 1321113102233203101 |
5 | 4113340232100113 |
6 | 135510515344213 |
7 | 12262201620252 |
oct | 1712722574321 |
9 | 413322836360 |
10 | 130313550033 |
11 | 502a1668997 |
12 | 213098b2069 |
13 | c399b37cb4 |
14 | 6442da8b29 |
15 | 35ca64c373 |
hex | 1e574af8d1 |
130313550033 has 32 divisors (see below), whose sum is σ = 194218984320. Its totient is φ = 86354372160.
The previous prime is 130313549987. The next prime is 130313550049. The reversal of 130313550033 is 330055313031.
It is a happy number.
130313550033 is a `hidden beast` number, since 1 + 303 + 1 + 355 + 0 + 0 + 3 + 3 = 666.
It is not a de Polignac number, because 130313550033 - 221 = 130311452881 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 130313549979 and 130313550006.
It is not an unprimeable number, because it can be changed into a prime (130313550083) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3127966 + ... + 3169352.
It is an arithmetic number, because the mean of its divisors is an integer number (6069343260).
Almost surely, 2130313550033 is an apocalyptic number.
It is an amenable number.
130313550033 is a deficient number, since it is larger than the sum of its proper divisors (63905434287).
130313550033 is a wasteful number, since it uses less digits than its factorization.
130313550033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42094 (or 42088 counting only the distinct ones).
The product of its (nonzero) digits is 6075, while the sum is 27.
Adding to 130313550033 its reverse (330055313031), we get a palindrome (460368863064).
The spelling of 130313550033 in words is "one hundred thirty billion, three hundred thirteen million, five hundred fifty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •