Base | Representation |
---|---|
bin | 11110110000000010110111… |
… | …000110101100000010111011 |
3 | 122201212002211100122012200210 |
4 | 132300002313012230002323 |
5 | 120211310132030402001 |
6 | 1155345435535002203 |
7 | 40325661446120061 |
oct | 3660026706540273 |
9 | 581762740565623 |
10 | 135243002200251 |
11 | 3a102264a67460 |
12 | 13202bbb969363 |
13 | 5a6048b9c2a0a |
14 | 2557b20c10031 |
15 | 1097eaa5a1dd6 |
hex | 7b00b71ac0bb |
135243002200251 has 64 divisors (see below), whose sum is σ = 197694592450560. Its totient is φ = 81559521648000.
The previous prime is 135243002200249. The next prime is 135243002200259. The reversal of 135243002200251 is 152002200342531.
It is not a de Polignac number, because 135243002200251 - 21 = 135243002200249 is a prime.
It is not an unprimeable number, because it can be changed into a prime (135243002200259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7601756166 + ... + 7601773956.
It is an arithmetic number, because the mean of its divisors is an integer number (3088978007040).
Almost surely, 2135243002200251 is an apocalyptic number.
135243002200251 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
135243002200251 is a deficient number, since it is larger than the sum of its proper divisors (62451590250309).
135243002200251 is a wasteful number, since it uses less digits than its factorization.
135243002200251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19648.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 135243002200251 its reverse (152002200342531), we get a palindrome (287245202542782).
The spelling of 135243002200251 in words is "one hundred thirty-five trillion, two hundred forty-three billion, two million, two hundred thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •