Base | Representation |
---|---|
bin | 11110010101010011100… |
… | …01010010001000001001 |
3 | 10200122011211021201002120 |
4 | 33022221301102020021 |
5 | 114033441432320231 |
6 | 2114443301321453 |
7 | 135204303561633 |
oct | 17125161221011 |
9 | 3618154251076 |
10 | 1042230354441 |
11 | 372009956271 |
12 | 149ba8a06289 |
13 | 77388449b53 |
14 | 38630d13a53 |
15 | 1c19de63d96 |
hex | f2a9c52209 |
1042230354441 has 8 divisors (see below), whose sum is σ = 1389646550784. Its totient is φ = 694817197200.
The previous prime is 1042230354379. The next prime is 1042230354491. The reversal of 1042230354441 is 1444530322401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1042230354441 - 213 = 1042230346249 is a prime.
It is a super-2 number, since 2×10422303544412 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1042230354491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 221455 + ... + 1460651.
It is an arithmetic number, because the mean of its divisors is an integer number (173705818848).
Almost surely, 21042230354441 is an apocalyptic number.
It is an amenable number.
1042230354441 is a deficient number, since it is larger than the sum of its proper divisors (347416196343).
1042230354441 is a wasteful number, since it uses less digits than its factorization.
1042230354441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1519551.
The product of its (nonzero) digits is 46080, while the sum is 33.
Adding to 1042230354441 its reverse (1444530322401), we get a palindrome (2486760676842).
The spelling of 1042230354441 in words is "one trillion, forty-two billion, two hundred thirty million, three hundred fifty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •