Base | Representation |
---|---|
bin | 11110111100110011111100… |
… | …001000000111101101100000 |
3 | 122211221222101002022122001112 |
4 | 132330303330020013231200 |
5 | 120320143420341011000 |
6 | 1201300452402122452 |
7 | 40446240521313566 |
oct | 3674637410075540 |
9 | 584858332278045 |
10 | 136120333532000 |
11 | 3a4103446a1284 |
12 | 13325048350428 |
13 | 5ac5127c3a94c |
14 | 258838b715a36 |
15 | 10b0c0791b235 |
hex | 7bccfc207b60 |
136120333532000 has 48 divisors (see below), whose sum is σ = 334447659497952. Its totient is φ = 54448133411200.
The previous prime is 136120333531993. The next prime is 136120333532039. The reversal of 136120333532000 is 235333021631.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17015037692 + ... + 17015045691.
It is an arithmetic number, because the mean of its divisors is an integer number (6967659572874).
Almost surely, 2136120333532000 is an apocalyptic number.
136120333532000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136120333532000 is an abundant number, since it is smaller than the sum of its proper divisors (198327325965952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136120333532000 is an equidigital number, since it uses as much as digits as its factorization.
136120333532000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34030083408 (or 34030083390 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 32.
Adding to 136120333532000 its reverse (235333021631), we get a palindrome (136355666553631).
The spelling of 136120333532000 in words is "one hundred thirty-six trillion, one hundred twenty billion, three hundred thirty-three million, five hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •