Base | Representation |
---|---|
bin | 111100100010101100… |
… | …0101111010100000001 |
3 | 110102120211122102101102 |
4 | 1321011120233110001 |
5 | 4112231330211113 |
6 | 135421024344145 |
7 | 12251563250111 |
oct | 1710530572401 |
9 | 412524572342 |
10 | 130013132033 |
11 | 50158029454 |
12 | 21245175055 |
13 | c34c821b75 |
14 | 6415127041 |
15 | 35ae0a9758 |
hex | 1e4562f501 |
130013132033 has 8 divisors (see below), whose sum is σ = 137009105856. Its totient is φ = 123129094000.
The previous prime is 130013131979. The next prime is 130013132047. The reversal of 130013132033 is 330231310031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130013132033 - 220 = 130012083457 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 130013131996 and 130013132014.
It is not an unprimeable number, because it can be changed into a prime (130013132233) 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 in 7 ways as a sum of consecutive naturals, for example, 27981563 + ... + 27986208.
It is an arithmetic number, because the mean of its divisors is an integer number (17126138232).
Almost surely, 2130013132033 is an apocalyptic number.
It is an amenable number.
130013132033 is a deficient number, since it is larger than the sum of its proper divisors (6995973823).
130013132033 is a wasteful number, since it uses less digits than its factorization.
130013132033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55967895.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 130013132033 its reverse (330231310031), we get a palindrome (460244442064).
The spelling of 130013132033 in words is "one hundred thirty billion, thirteen million, one hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •