Base | Representation |
---|---|
bin | 101101110000000000100011… |
… | …010110100110011010110100 |
3 | 222101102121022221122112122112 |
4 | 231300000203112212122310 |
5 | 202333121040034310400 |
6 | 1551535054151150152 |
7 | 60245013426114650 |
oct | 5560004326463264 |
9 | 871377287575575 |
10 | 201211221010100 |
11 | 59126221770404 |
12 | 1a6980ba975358 |
13 | 88371a1503622 |
14 | 379896450da60 |
15 | 183de73e23835 |
hex | b700235a66b4 |
201211221010100 has 36 divisors (see below), whose sum is σ = 499003828106784. Its totient is φ = 68986704346080.
The previous prime is 201211221010099. The next prime is 201211221010109. The reversal of 201211221010100 is 1010122112102.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201211221010109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 143722300022 + ... + 143722301421.
Almost surely, 2201211221010100 is an apocalyptic number.
201211221010100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201211221010100 is an abundant number, since it is smaller than the sum of its proper divisors (297792607096684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201211221010100 is a wasteful number, since it uses less digits than its factorization.
201211221010100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287444601464 (or 287444601457 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201211221010100 its reverse (1010122112102), we get a palindrome (202221343122202).
The spelling of 201211221010100 in words is "two hundred one trillion, two hundred eleven billion, two hundred twenty-one million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.403 sec. • engine limits •