Base | Representation |
---|---|
bin | 111111000110001110… |
… | …1100101000000111000 |
3 | 110221202021012010222022 |
4 | 1332030131211000320 |
5 | 4210001120101300 |
6 | 142125331014012 |
7 | 12534554446601 |
oct | 1761435450070 |
9 | 427667163868 |
10 | 135500550200 |
11 | 52513589994 |
12 | 22316a3a308 |
13 | ca1564ba72 |
14 | 67b5c26da8 |
15 | 37d0be1285 |
hex | 1f8c765038 |
135500550200 has 96 divisors (see below), whose sum is σ = 333687191760. Its totient is φ = 50994124800.
The previous prime is 135500550181. The next prime is 135500550223. The reversal of 135500550200 is 2055005531.
It is a self number, because there is not a number n which added to its sum of digits gives 135500550200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13639235 + ... + 13649165.
Almost surely, 2135500550200 is an apocalyptic number.
135500550200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 135500550200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166843595880).
135500550200 is an abundant number, since it is smaller than the sum of its proper divisors (198186641560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135500550200 is a wasteful number, since it uses less digits than its factorization.
135500550200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13977 (or 13968 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 26.
Adding to 135500550200 its reverse (2055005531), we get a palindrome (137555555731).
The spelling of 135500550200 in words is "one hundred thirty-five billion, five hundred million, five hundred fifty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •