Base | Representation |
---|---|
bin | 10011001100111000111100… |
… | …10001001111010001001101 |
3 | 12112111121101020201210102112 |
4 | 21212130132101033101031 |
5 | 21013300412304304240 |
6 | 225445331240033405 |
7 | 11615415202242656 |
oct | 1146343621172115 |
9 | 175447336653375 |
10 | 42224331322445 |
11 | 124aa2692777a8 |
12 | 489b437162865 |
13 | 1a73977c90ccc |
14 | a5d95069052d |
15 | 4d35422a9665 |
hex | 26671e44f44d |
42224331322445 has 32 divisors (see below), whose sum is σ = 51626810073600. Its totient is φ = 33145238624256.
The previous prime is 42224331322333. The next prime is 42224331322457. The reversal of 42224331322445 is 54422313342224.
42224331322445 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 42224331322445 - 28 = 42224331322189 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 95402621 + ... + 95844189.
It is an arithmetic number, because the mean of its divisors is an integer number (1613337814800).
Almost surely, 242224331322445 is an apocalyptic number.
It is an amenable number.
42224331322445 is a deficient number, since it is larger than the sum of its proper divisors (9402478751155).
42224331322445 is a wasteful number, since it uses less digits than its factorization.
42224331322445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442757.
The product of its digits is 1105920, while the sum is 41.
Adding to 42224331322445 its reverse (54422313342224), we get a palindrome (96646644664669).
The spelling of 42224331322445 in words is "forty-two trillion, two hundred twenty-four billion, three hundred thirty-one million, three hundred twenty-two thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •