Base | Representation |
---|---|
bin | 11110011000101001100100… |
… | …100110010110010001100010 |
3 | 122112011102001211201200212122 |
4 | 132120221210212112101202 |
5 | 120003440043324101200 |
6 | 1152115113122024242 |
7 | 40101555213563054 |
oct | 3630514446262142 |
9 | 575142054650778 |
10 | 133635300222050 |
11 | 3964245a123830 |
12 | 12ba34bb7a8082 |
13 | 59749a7211133 |
14 | 24ddda96758d4 |
15 | 106b262c40385 |
hex | 798a64996462 |
133635300222050 has 24 divisors (see below), whose sum is σ = 271158172815312. Its totient is φ = 48594654626000.
The previous prime is 133635300222049. The next prime is 133635300222089. The reversal of 133635300222050 is 50222003536331.
It is a self number, because there is not a number n which added to its sum of digits gives 133635300222050.
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, 121486636016 + ... + 121486637115.
It is an arithmetic number, because the mean of its divisors is an integer number (11298257200638).
Almost surely, 2133635300222050 is an apocalyptic number.
133635300222050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133635300222050 is an abundant number, since it is smaller than the sum of its proper divisors (137522872593262).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133635300222050 is a wasteful number, since it uses less digits than its factorization.
133635300222050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242973273154 (or 242973273149 counting only the distinct ones).
The product of its (nonzero) digits is 97200, while the sum is 35.
Adding to 133635300222050 its reverse (50222003536331), we get a palindrome (183857303758381).
The spelling of 133635300222050 in words is "one hundred thirty-three trillion, six hundred thirty-five billion, three hundred million, two hundred twenty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •