Base | Representation |
---|---|
bin | 1110001101000111110… |
… | …0000111000001011011 |
3 | 212022220120222222121120 |
4 | 3203101330013001123 |
5 | 12444243313122443 |
6 | 304035515540323 |
7 | 23426355604023 |
oct | 3432174070133 |
9 | 768816888546 |
10 | 244040364123 |
11 | 94551472646 |
12 | 3b36875a6a3 |
13 | 1a02248662a |
14 | bb5110ca83 |
15 | 6534a06083 |
hex | 38d1f0705b |
244040364123 has 8 divisors (see below), whose sum is σ = 333323424336. Its totient is φ = 158725440000.
The previous prime is 244040364103. The next prime is 244040364143. The reversal of 244040364123 is 321463040442.
244040364123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (244040364103) and next prime (244040364143).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 244040364123 - 26 = 244040364059 is a prime.
It is not an unprimeable number, because it can be changed into a prime (244040364103) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 992033878 + ... + 992034123.
It is an arithmetic number, because the mean of its divisors is an integer number (41665428042).
Almost surely, 2244040364123 is an apocalyptic number.
244040364123 is a deficient number, since it is larger than the sum of its proper divisors (89283060213).
244040364123 is a wasteful number, since it uses less digits than its factorization.
244040364123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1984068045.
The product of its (nonzero) digits is 55296, while the sum is 33.
The spelling of 244040364123 in words is "two hundred forty-four billion, forty million, three hundred sixty-four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •