Base | Representation |
---|---|
bin | 101101110001010011001111… |
… | …100110011111001111110100 |
3 | 222101202002111211011211110010 |
4 | 231301103033212133033310 |
5 | 202341044410102431400 |
6 | 1552043540435500220 |
7 | 60254305623600015 |
oct | 5561231746371764 |
9 | 871662454154403 |
10 | 201300010202100 |
11 | 5915a944973527 |
12 | 1a6b135a157670 |
13 | 8842681518b64 |
14 | 379cd886a700c |
15 | 184141dd2c450 |
hex | b714cf99f3f4 |
201300010202100 has 36 divisors (see below), whose sum is σ = 582428029518944. Its totient is φ = 53680002720480.
The previous prime is 201300010202021. The next prime is 201300010202117. The reversal of 201300010202100 is 1202010003102.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 335500016704 + ... + 335500017303.
Almost surely, 2201300010202100 is an apocalyptic number.
201300010202100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201300010202100 is an abundant number, since it is smaller than the sum of its proper divisors (381128019316844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201300010202100 is a wasteful number, since it uses less digits than its factorization.
201300010202100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671000034024 (or 671000034017 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 201300010202100 its reverse (1202010003102), we get a palindrome (202502020205202).
The spelling of 201300010202100 in words is "two hundred one trillion, three hundred billion, ten million, two hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •