Base | Representation |
---|---|
bin | 1110001101011011110… |
… | …0010011001101010000 |
3 | 212100010102221101010220 |
4 | 3203112330103031100 |
5 | 12444431310100422 |
6 | 304052114553040 |
7 | 23431425212250 |
oct | 3432674231520 |
9 | 770112841126 |
10 | 244124300112 |
11 | 94594891a30 |
12 | 3b390898780 |
13 | 1a0369943b4 |
14 | bb5c31b960 |
15 | 653c085e5c |
hex | 38d6f13350 |
244124300112 has 80 divisors (see below), whose sum is σ = 786270484992. Its totient is φ = 63408908160.
The previous prime is 244124300107. The next prime is 244124300129. The reversal of 244124300112 is 211003421442.
244124300112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (24).
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 15 ways as a sum of consecutive naturals, for example, 33021778 + ... + 33029169.
Almost surely, 2244124300112 is an apocalyptic number.
244124300112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
244124300112 is an abundant number, since it is smaller than the sum of its proper divisors (542146184880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
244124300112 is a wasteful number, since it uses less digits than its factorization.
244124300112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66050976 (or 66050970 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 244124300112 its reverse (211003421442), we get a palindrome (455127721554).
The spelling of 244124300112 in words is "two hundred forty-four billion, one hundred twenty-four million, three hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •