Base | Representation |
---|---|
bin | 11110101011110110000… |
… | …10000000101010111101 |
3 | 10201210102010222220000002 |
4 | 33111323002000222331 |
5 | 114233232231042000 |
6 | 2124204130444045 |
7 | 136113210404564 |
oct | 17257302005275 |
9 | 3653363886002 |
10 | 1054331112125 |
11 | 377159476655 |
12 | 150405433625 |
13 | 7856642bcb5 |
14 | 3905c07cbdb |
15 | 1c65b4888d5 |
hex | f57b080abd |
1054331112125 has 16 divisors (see below), whose sum is σ = 1317748916016. Its totient is φ = 842218936000.
The previous prime is 1054331112049. The next prime is 1054331112137. The reversal of 1054331112125 is 5212111334501.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 268849509049 + 785481603076 = 518507^2 + 886274^2 .
It is not a de Polignac number, because 1054331112125 - 212 = 1054331108029 is a prime.
It is a super-2 number, since 2×10543311121252 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6144806 + ... + 6314055.
It is an arithmetic number, because the mean of its divisors is an integer number (82359307251).
Almost surely, 21054331112125 is an apocalyptic number.
It is an amenable number.
1054331112125 is a deficient number, since it is larger than the sum of its proper divisors (263417803891).
1054331112125 is an equidigital number, since it uses as much as digits as its factorization.
1054331112125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12459553 (or 12459543 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 1054331112125 its reverse (5212111334501), we get a palindrome (6266442446626).
The spelling of 1054331112125 in words is "one trillion, fifty-four billion, three hundred thirty-one million, one hundred twelve thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •