Base | Representation |
---|---|
bin | 10010110100000101… |
… | …100100111100101000 |
3 | 1221010212011211002011 |
4 | 102310011210330220 |
5 | 312333003330440 |
6 | 13140314245304 |
7 | 1313414423431 |
oct | 226405447450 |
9 | 57125154064 |
10 | 20201230120 |
11 | 8627082205 |
12 | 3ab9426834 |
13 | 1b9c2a2b06 |
14 | d98d08488 |
15 | 7d37699ea |
hex | 4b4164f28 |
20201230120 has 32 divisors (see below), whose sum is σ = 45511943400. Its totient is φ = 8069971968.
The previous prime is 20201230109. The next prime is 20201230121. The reversal of 20201230120 is 2103210202.
It can be written as a sum of positive squares in 4 ways, for example, as 15830169124 + 4371060996 = 125818^2 + 66114^2 .
It is a super-2 number, since 2×202012301202 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20201230120.
It is not an unprimeable number, because it can be changed into a prime (20201230121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 297609 + ... + 359128.
Almost surely, 220201230120 is an apocalyptic number.
20201230120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20201230120 is an abundant number, since it is smaller than the sum of its proper divisors (25310713280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20201230120 is a wasteful number, since it uses less digits than its factorization.
20201230120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 657517 (or 657513 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 20201230120 its reverse (2103210202), we get a palindrome (22304440322).
The spelling of 20201230120 in words is "twenty billion, two hundred one million, two hundred thirty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •