Base | Representation |
---|---|
bin | 111100101000010010… |
… | …1011100011111111100 |
3 | 110110001221011201112212 |
4 | 1321100211130133330 |
5 | 4113122424342340 |
6 | 135451415315552 |
7 | 12256334225546 |
oct | 1712045343774 |
9 | 413057151485 |
10 | 130201012220 |
11 | 50244093634 |
12 | 2129807bbb8 |
13 | c37c724786 |
14 | 6432072696 |
15 | 35c081ca65 |
hex | 1e5095c7fc |
130201012220 has 12 divisors (see below), whose sum is σ = 273422125704. Its totient is φ = 52080404880.
The previous prime is 130201012217. The next prime is 130201012261. The reversal of 130201012220 is 22210102031.
It is a happy number.
It is a super-2 number, since 2×1302010122202 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130201012195 and 130201012204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3255025286 + ... + 3255025325.
It is an arithmetic number, because the mean of its divisors is an integer number (22785177142).
Almost surely, 2130201012220 is an apocalyptic number.
130201012220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
130201012220 is an abundant number, since it is smaller than the sum of its proper divisors (143221113484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130201012220 is a wasteful number, since it uses less digits than its factorization.
130201012220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6510050620 (or 6510050618 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 130201012220 its reverse (22210102031), we get a palindrome (152411114251).
The spelling of 130201012220 in words is "one hundred thirty billion, two hundred one million, twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •