Base | Representation |
---|---|
bin | 101101101101000111001110… |
… | …101100101001010011101000 |
3 | 222100201120201002011011020110 |
4 | 231231013032230221103220 |
5 | 202321341022422330440 |
6 | 1551303424503054320 |
7 | 60224440334312163 |
oct | 5555071654512350 |
9 | 870646632134213 |
10 | 201012232230120 |
11 | 59059899796833 |
12 | 1a665625a413a0 |
13 | 88214ab84c5bc |
14 | 378d08885aada |
15 | 1838bc964a080 |
hex | b6d1ceb294e8 |
201012232230120 has 64 divisors (see below), whose sum is σ = 609812389944000. Its totient is φ = 53000978083328.
The previous prime is 201012232230107. The next prime is 201012232230157. The reversal of 201012232230120 is 21032232210102.
It is a super-2 number, since 2×2010122322301202 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9410674350 + ... + 9410695709.
It is an arithmetic number, because the mean of its divisors is an integer number (9528318592875).
Almost surely, 2201012232230120 is an apocalyptic number.
201012232230120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201012232230120 is an abundant number, since it is smaller than the sum of its proper divisors (408800157713880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201012232230120 is a wasteful number, since it uses less digits than its factorization.
201012232230120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18821370162 (or 18821370158 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 201012232230120 its reverse (21032232210102), we get a palindrome (222044464440222).
The spelling of 201012232230120 in words is "two hundred one trillion, twelve billion, two hundred thirty-two million, two hundred thirty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •