Base | Representation |
---|---|
bin | 101101101111111111011011… |
… | …010011001000001001000100 |
3 | 222101102111012200221120202120 |
4 | 231233333123103020021010 |
5 | 202333111101101440400 |
6 | 1551534334205005540 |
7 | 60244641446644425 |
oct | 5557773323101104 |
9 | 871374180846676 |
10 | 201210012140100 |
11 | 59125761356497 |
12 | 1a697a21b538b0 |
13 | 883703ac24a32 |
14 | 379888bb5164c |
15 | 183de02c34ca0 |
hex | b6ffdb4c8244 |
201210012140100 has 36 divisors (see below), whose sum is σ = 582167635126224. Its totient is φ = 53656003237280.
The previous prime is 201210012140063. The next prime is 201210012140143. The reversal of 201210012140100 is 1041210012102.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 201210012140100.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 335350019934 + ... + 335350020533.
Almost surely, 2201210012140100 is an apocalyptic number.
201210012140100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201210012140100 is an abundant number, since it is smaller than the sum of its proper divisors (380957622986124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201210012140100 is a wasteful number, since it uses less digits than its factorization.
201210012140100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 670700040484 (or 670700040477 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201210012140100 its reverse (1041210012102), we get a palindrome (202251222152202).
The spelling of 201210012140100 in words is "two hundred one trillion, two hundred ten billion, twelve million, one hundred forty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •