Base | Representation |
---|---|
bin | 10111111110100… |
… | …00000010001000 |
3 | 112000110110122201 |
4 | 23333100002020 |
5 | 402442130440 |
6 | 31542525544 |
7 | 4661402122 |
oct | 1377200210 |
9 | 460413581 |
10 | 201130120 |
11 | a3595044 |
12 | 574368b4 |
13 | 32891809 |
14 | 1c9d8212 |
15 | 129ce19a |
hex | bfd0088 |
201130120 has 32 divisors (see below), whose sum is σ = 453389400. Its totient is φ = 80301568.
The previous prime is 201130103. The next prime is 201130141. The reversal of 201130120 is 21031102.
It can be written as a sum of positive squares in 4 ways, for example, as 187306596 + 13823524 = 13686^2 + 3718^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 201130097 and 201130106.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18342 + ... + 27178.
Almost surely, 2201130120 is an apocalyptic number.
201130120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201130120 is an abundant number, since it is smaller than the sum of its proper divisors (252259280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201130120 is a wasteful number, since it uses less digits than its factorization.
201130120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9417 (or 9413 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 201130120 is about 14182.0351148910. The cubic root of 201130120 is about 585.9029764003.
Adding to 201130120 its reverse (21031102), we get a palindrome (222161222).
It can be divided in two parts, 2011 and 30120, that added together give a triangular number (32131 = T253).
The spelling of 201130120 in words is "two hundred one million, one hundred thirty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •