Base | Representation |
---|---|
bin | 1110001000110100110… |
… | …1101100110100101010 |
3 | 212012221020101200011010 |
4 | 3202031031230310222 |
5 | 12434413130104443 |
6 | 303325250444350 |
7 | 23355655250355 |
oct | 3421515546452 |
9 | 765836350133 |
10 | 242887347498 |
11 | 9400a637144 |
12 | 3b0a65936b6 |
13 | 19b9a632483 |
14 | ba81d2d29c |
15 | 64b869b733 |
hex | 388d36cd2a |
242887347498 has 8 divisors (see below), whose sum is σ = 485774695008. Its totient is φ = 80962449164.
The previous prime is 242887347487. The next prime is 242887347503. The reversal of 242887347498 is 894743788242.
242887347498 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
242887347498 is an admirable number.
It is a super-2 number, since 2×2428873474982 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20240612286 + ... + 20240612297.
It is an arithmetic number, because the mean of its divisors is an integer number (60721836876).
Almost surely, 2242887347498 is an apocalyptic number.
242887347498 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.
242887347498 is a wasteful number, since it uses less digits than its factorization.
242887347498 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40481224588.
The product of its digits is 173408256, while the sum is 66.
The spelling of 242887347498 in words is "two hundred forty-two billion, eight hundred eighty-seven million, three hundred forty-seven thousand, four hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •