Base | Representation |
---|---|
bin | 10001101001110011101… |
… | …001110010000010111000 |
3 | 11021222021111101120101220 |
4 | 101221303221302002320 |
5 | 124333433001011300 |
6 | 2325144455312040 |
7 | 153434162204436 |
oct | 21516351620270 |
9 | 4258244346356 |
10 | 1213121110200 |
11 | 42853327141a |
12 | 17713b97b620 |
13 | 8a520ab1a3c |
14 | 42a02dbbd56 |
15 | 21851ab1da0 |
hex | 11a73a720b8 |
1213121110200 has 96 divisors (see below), whose sum is σ = 3812191681200. Its totient is φ = 319067458560.
The previous prime is 1213121110199. The next prime is 1213121110241. The reversal of 1213121110200 is 20111213121.
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 1213121110200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13804615 + ... + 13892214.
Almost surely, 21213121110200 is an apocalyptic number.
1213121110200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1213121110200 is an abundant number, since it is smaller than the sum of its proper divisors (2599070571000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1213121110200 is a wasteful number, since it uses less digits than its factorization.
1213121110200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27696921 (or 27696912 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1213121110200 its reverse (20111213121), we get a palindrome (1233232323321).
The spelling of 1213121110200 in words is "one trillion, two hundred thirteen billion, one hundred twenty-one million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •