Base | Representation |
---|---|
bin | 11110101011101011011… |
… | …11110001010000010001 |
3 | 10201210011222011002121202 |
4 | 33111311233301100101 |
5 | 114233042031204210 |
6 | 2124151242200545 |
7 | 136111052631041 |
oct | 17256557612021 |
9 | 3653158132552 |
10 | 1054242444305 |
11 | 377113415166 |
12 | 15039b7b3155 |
13 | 78550c5552b |
14 | 3905039b721 |
15 | 1c6537c19a5 |
hex | f575bf1411 |
1054242444305 has 8 divisors (see below), whose sum is σ = 1265142305832. Its totient is φ = 843359707008.
The previous prime is 1054242444197. The next prime is 1054242444323. The reversal of 1054242444305 is 5034442424501.
It can be written as a sum of positive squares in 4 ways, for example, as 159182646529 + 895059797776 = 398977^2 + 946076^2 .
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 1054242444305 - 216 = 1054242378769 is a prime.
It is a super-2 number, since 2×10542424443052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4145222 + ... + 4392191.
It is an arithmetic number, because the mean of its divisors is an integer number (158142788229).
Almost surely, 21054242444305 is an apocalyptic number.
It is an amenable number.
1054242444305 is a deficient number, since it is larger than the sum of its proper divisors (210899861527).
1054242444305 is an equidigital number, since it uses as much as digits as its factorization.
1054242444305 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8562115.
The product of its (nonzero) digits is 307200, while the sum is 38.
Adding to 1054242444305 its reverse (5034442424501), we get a palindrome (6088684868806).
The spelling of 1054242444305 in words is "one trillion, fifty-four billion, two hundred forty-two million, four hundred forty-four thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •