Base | Representation |
---|---|
bin | 101101101101001111100101… |
… | …110100001000001001010000 |
3 | 222100202102212202102020000002 |
4 | 231231033211310020021100 |
5 | 202322012414230031000 |
6 | 1551311511411545132 |
7 | 60225205660154213 |
oct | 5555174564101120 |
9 | 870672782366002 |
10 | 201021210002000 |
11 | 59062686485713 |
12 | 1a6673105bb1a8 |
13 | 88222ac81925b |
14 | 378d69ad2777a |
15 | 18390528d58d5 |
hex | b6d3e5d08250 |
201021210002000 has 40 divisors (see below), whose sum is σ = 486069285789672. Its totient is φ = 80408484000000.
The previous prime is 201021210001991. The next prime is 201021210002027. The reversal of 201021210002000 is 200012120102.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 57562811784256 + 143458398217744 = 7587016^2 + 11977412^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50255300501 + ... + 50255304500.
Almost surely, 2201021210002000 is an apocalyptic number.
201021210002000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201021210002000 is an abundant number, since it is smaller than the sum of its proper divisors (285048075787672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201021210002000 is a wasteful number, since it uses less digits than its factorization.
201021210002000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100510605024 (or 100510605008 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 201021210002000 its reverse (200012120102), we get a palindrome (201221222122102).
The spelling of 201021210002000 in words is "two hundred one trillion, twenty-one billion, two hundred ten million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •