Base | Representation |
---|---|
bin | 10011000110111100000… |
… | …111110111000000011000 |
3 | 11122112101200012120212000 |
4 | 103012330013313000120 |
5 | 133003233011432300 |
6 | 2443123424321000 |
7 | 163604240025243 |
oct | 23067407670030 |
9 | 4575350176760 |
10 | 1313121202200 |
11 | 46698975a655 |
12 | 1925a9773160 |
13 | 96a99624302 |
14 | 477ac06425a |
15 | 24255d18c00 |
hex | 131bc1f7018 |
1313121202200 has 96 divisors (see below), whose sum is σ = 4522973048400. Its totient is φ = 350165652480.
The previous prime is 1313121202193. The next prime is 1313121202243. The reversal of 1313121202200 is 22021213131.
1313121202200 is a `hidden beast` number, since 1 + 31 + 312 + 120 + 2 + 200 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 121579897 + ... + 121590696.
Almost surely, 21313121202200 is an apocalyptic number.
1313121202200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1313121202200 is an abundant number, since it is smaller than the sum of its proper divisors (3209851846200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1313121202200 is a wasteful number, since it uses less digits than its factorization.
1313121202200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243170618 (or 243170603 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1313121202200 its reverse (22021213131), we get a palindrome (1335142415331).
The spelling of 1313121202200 in words is "one trillion, three hundred thirteen billion, one hundred twenty-one million, two hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •