Base | Representation |
---|---|
bin | 1111011111110… |
… | …10110001100100 |
3 | 100001121210020122 |
4 | 13233322301210 |
5 | 231240031040 |
6 | 20522221112 |
7 | 3135666431 |
oct | 757726144 |
9 | 301553218 |
10 | 130002020 |
11 | 67423495 |
12 | 37654798 |
13 | 20c19695 |
14 | 133a0b88 |
15 | b62e1b5 |
hex | 7bfac64 |
130002020 has 12 divisors (see below), whose sum is σ = 273004284. Its totient is φ = 52000800.
The previous prime is 130002013. The next prime is 130002031. The reversal of 130002020 is 20200031.
It can be written as a sum of positive squares in 2 ways, for example, as 43586404 + 86415616 = 6602^2 + 9296^2 .
It is a junction number, because it is equal to n+sod(n) for n = 130001989 and 130002007.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 3250031 + ... + 3250070.
It is an arithmetic number, because the mean of its divisors is an integer number (22750357).
Almost surely, 2130002020 is an apocalyptic number.
130002020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130002020 is an abundant number, since it is smaller than the sum of its proper divisors (143002264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130002020 is a wasteful number, since it uses less digits than its factorization.
130002020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6500110 (or 6500108 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 8.
The square root of 130002020 is about 11401.8428335072. The cubic root of 130002020 is about 506.5823257196.
Adding to 130002020 its reverse (20200031), we get a palindrome (150202051).
The spelling of 130002020 in words is "one hundred thirty million, two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •