Base | Representation |
---|---|
bin | 1011101100110101010… |
… | …0001000100110100010 |
3 | 201012211221121122120010 |
4 | 2323031110020212202 |
5 | 11243133323244020 |
6 | 232202200225350 |
7 | 20344202120046 |
oct | 2731524104642 |
9 | 635757548503 |
10 | 201013103010 |
11 | 78281724515 |
12 | 32b5aa6b256 |
13 | 15c56196405 |
14 | 9a2c880026 |
15 | 5367392de0 |
hex | 2ecd5089a2 |
201013103010 has 64 divisors (see below), whose sum is σ = 495346005504. Its totient is φ = 52174617600.
The previous prime is 201013102973. The next prime is 201013103047. The reversal of 201013103010 is 10301310102.
It is an interprime number because it is at equal distance from previous prime (201013102973) and next prime (201013103047).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 340542 + ... + 719718.
It is an arithmetic number, because the mean of its divisors is an integer number (7739781336).
Almost surely, 2201013103010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201013103010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (247673002752).
201013103010 is an abundant number, since it is smaller than the sum of its proper divisors (294332902494).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201013103010 is a wasteful number, since it uses less digits than its factorization.
201013103010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379659.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 201013103010 its reverse (10301310102), we get a palindrome (211314413112).
The spelling of 201013103010 in words is "two hundred one billion, thirteen million, one hundred three thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.208 sec. • engine limits •