Base | Representation |
---|---|
bin | 100000110100001011100… |
… | …010111000010100001110 |
3 | 21222120200102021200101110 |
4 | 200310023202320110032 |
5 | 243421321142221332 |
6 | 4443542324152450 |
7 | 321631164453102 |
oct | 40641342702416 |
9 | 7876612250343 |
10 | 2255051523342 |
11 | 79a3a8883312 |
12 | 305064238726 |
13 | 13485c051717 |
14 | 7b206135902 |
15 | 3d9d45294cc |
hex | 20d0b8b850e |
2255051523342 has 8 divisors (see below), whose sum is σ = 4510103046696. Its totient is φ = 751683841112.
The previous prime is 2255051523311. The next prime is 2255051523349. The reversal of 2255051523342 is 2433251505522.
It is a sphenic number, since it is the product of 3 distinct primes.
2255051523342 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 2255051523342.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2255051523349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 187920960273 + ... + 187920960284.
It is an arithmetic number, because the mean of its divisors is an integer number (563762880837).
Almost surely, 22255051523342 is an apocalyptic number.
2255051523342 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2255051523342 is a wasteful number, since it uses less digits than its factorization.
2255051523342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375841920562.
The product of its (nonzero) digits is 360000, while the sum is 39.
The spelling of 2255051523342 in words is "two trillion, two hundred fifty-five billion, fifty-one million, five hundred twenty-three thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •