Base | Representation |
---|---|
bin | 111100101001001010… |
… | …0000010010101011001 |
3 | 110110010221201121110200 |
4 | 1321102110002111121 |
5 | 4113202340044113 |
6 | 135454332532413 |
7 | 12260135522064 |
oct | 1712224022531 |
9 | 413127647420 |
10 | 130230003033 |
11 | 50259494889 |
12 | 212a5921109 |
13 | c3857352c0 |
14 | 6435c5b8db |
15 | 35c3147873 |
hex | 1e52502559 |
130230003033 has 48 divisors (see below), whose sum is σ = 206112816000. Its totient is φ = 78745261824.
The previous prime is 130230002993. The next prime is 130230003037. The reversal of 130230003033 is 330300032031.
130230003033 is a `hidden beast` number, since 1 + 302 + 300 + 0 + 30 + 33 = 666.
It is not a de Polignac number, because 130230003033 - 218 = 130229740889 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130230002997 and 130230003015.
It is not an unprimeable number, because it can be changed into a prime (130230003037) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22148788 + ... + 22154666.
It is an arithmetic number, because the mean of its divisors is an integer number (4294017000).
Almost surely, 2130230003033 is an apocalyptic number.
130230003033 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
130230003033 is a deficient number, since it is larger than the sum of its proper divisors (75882812967).
130230003033 is a wasteful number, since it uses less digits than its factorization.
130230003033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9166 (or 9163 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 18.
Adding to 130230003033 its reverse (330300032031), we get a palindrome (460530035064).
The spelling of 130230003033 in words is "one hundred thirty billion, two hundred thirty million, three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •