Base | Representation |
---|---|
bin | 1111011111111… |
… | …01001101110100 |
3 | 100001122021222000 |
4 | 13233331031310 |
5 | 231240341040 |
6 | 20522335300 |
7 | 3136040535 |
oct | 757751564 |
9 | 301567860 |
10 | 130012020 |
11 | 6742aa56 |
12 | 3765a530 |
13 | 20c210b8 |
14 | 133a468c |
15 | b632130 |
hex | 7bfd374 |
130012020 has 48 divisors (see below), whose sum is σ = 404483520. Its totient is φ = 34669728.
The previous prime is 130012019. The next prime is 130012033. The reversal of 130012020 is 20210031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 130011993 and 130012011.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 119842 + ... + 120921.
It is an arithmetic number, because the mean of its divisors is an integer number (8426740).
Almost surely, 2130012020 is an apocalyptic number.
130012020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130012020 is an abundant number, since it is smaller than the sum of its proper divisors (274471500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130012020 is a wasteful number, since it uses less digits than its factorization.
130012020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240781 (or 240773 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 130012020 is about 11402.2813506772. The cubic root of 130012020 is about 506.5953144751.
Adding to 130012020 its reverse (20210031), we get a palindrome (150222051).
The spelling of 130012020 in words is "one hundred thirty million, twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •