Base | Representation |
---|---|
bin | 1110001111000100011… |
… | …1110100000100110110 |
3 | 212101021001102100201020 |
4 | 3203301013310010312 |
5 | 13001331230312232 |
6 | 304203445042010 |
7 | 23445340446111 |
oct | 3436107640466 |
9 | 771231370636 |
10 | 244563525942 |
11 | 9479a80988a |
12 | 3b4939b6306 |
13 | 1a0a698b038 |
14 | bba07b3578 |
15 | 65658e6e2c |
hex | 38f11f4136 |
244563525942 has 8 divisors (see below), whose sum is σ = 489127051896. Its totient is φ = 81521175312.
The previous prime is 244563525929. The next prime is 244563525977. The reversal of 244563525942 is 249525365442.
244563525942 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.
244563525942 is an admirable number.
It is a super-2 number, since 2×2445635259422 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
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, 20380293823 + ... + 20380293834.
It is an arithmetic number, because the mean of its divisors is an integer number (61140881487).
Almost surely, 2244563525942 is an apocalyptic number.
244563525942 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.
244563525942 is a wasteful number, since it uses less digits than its factorization.
244563525942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40760587662.
The product of its digits is 10368000, while the sum is 51.
The spelling of 244563525942 in words is "two hundred forty-four billion, five hundred sixty-three million, five hundred twenty-five thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •