Base | Representation |
---|---|
bin | 1011101100110101000… |
… | …1011111111001100000 |
3 | 201012211220022112200011 |
4 | 2323031101133321200 |
5 | 11243133134141000 |
6 | 232202133334304 |
7 | 20344163211331 |
oct | 2731521377140 |
9 | 635756275604 |
10 | 201012412000 |
11 | 782812a2334 |
12 | 32b5a797394 |
13 | 15c55cb3a2a |
14 | 9a2c740288 |
15 | 53672a82ba |
hex | 2ecd45fe60 |
201012412000 has 96 divisors (see below), whose sum is σ = 495356359680. Its totient is φ = 80165836800.
The previous prime is 201012411923. The next prime is 201012412049. The reversal of 201012412000 is 214210102.
It is a happy number.
It is a congruent number.
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, 1273441 + ... + 1422559.
It is an arithmetic number, because the mean of its divisors is an integer number (5159962080).
Almost surely, 2201012412000 is an apocalyptic number.
201012412000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201012412000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (247678179840).
201012412000 is an abundant number, since it is smaller than the sum of its proper divisors (294343947680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201012412000 is a wasteful number, since it uses less digits than its factorization.
201012412000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149481 (or 149463 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 201012412000 its reverse (214210102), we get a palindrome (201226622102).
The spelling of 201012412000 in words is "two hundred one billion, twelve million, four hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •