Base | Representation |
---|---|
bin | 111101110001000000001… |
… | …011011011001111000011 |
3 | 120000202210210220102221211 |
4 | 331301000023123033003 |
5 | 1024020221113103121 |
6 | 13005522020230551 |
7 | 615440530222405 |
oct | 75610013331703 |
9 | 16022723812854 |
10 | 4244504425411 |
11 | 13970a2104338 |
12 | 586743b3b457 |
13 | 24a341463033 |
14 | 109613d2ab75 |
15 | 756215cace1 |
hex | 3dc402db3c3 |
4244504425411 has 8 divisors (see below), whose sum is σ = 4254718916448. Its totient is φ = 4234294296000.
The previous prime is 4244504425361. The next prime is 4244504425417. The reversal of 4244504425411 is 1145244054424.
4244504425411 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.
It is a cyclic number.
It is not a de Polignac number, because 4244504425411 - 221 = 4244502328259 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4244504425417) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 862431 + ... + 3038551.
It is an arithmetic number, because the mean of its divisors is an integer number (531839864556).
Almost surely, 24244504425411 is an apocalyptic number.
4244504425411 is a deficient number, since it is larger than the sum of its proper divisors (10214491037).
4244504425411 is a wasteful number, since it uses less digits than its factorization.
4244504425411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2180813.
The product of its (nonzero) digits is 409600, while the sum is 40.
Adding to 4244504425411 its reverse (1145244054424), we get a palindrome (5389748479835).
The spelling of 4244504425411 in words is "four trillion, two hundred forty-four billion, five hundred four million, four hundred twenty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •