Base | Representation |
---|---|
bin | 11110101100000001010… |
… | …01011011111101101011 |
3 | 10201210122201021211120202 |
4 | 33112000221123331223 |
5 | 114233430341133421 |
6 | 2124221334142415 |
7 | 136115433312026 |
oct | 17260051337553 |
9 | 3653581254522 |
10 | 1054425333611 |
11 | 3771a7680651 |
12 | 150430ab1a0b |
13 | 7857cacb560 |
14 | 3906a7a81bd |
15 | 1c66489b10b |
hex | f580a5bf6b |
1054425333611 has 4 divisors (see below), whose sum is σ = 1135534974672. Its totient is φ = 973315692552.
The previous prime is 1054425333571. The next prime is 1054425333631. The reversal of 1054425333611 is 1163335244501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1054425333611 - 214 = 1054425317227 is a prime.
It is a super-3 number, since 3×10544253336113 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1054425333631) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 40554820511 + ... + 40554820536.
It is an arithmetic number, because the mean of its divisors is an integer number (283883743668).
Almost surely, 21054425333611 is an apocalyptic number.
1054425333611 is a deficient number, since it is larger than the sum of its proper divisors (81109641061).
1054425333611 is an equidigital number, since it uses as much as digits as its factorization.
1054425333611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81109641060.
The product of its (nonzero) digits is 129600, while the sum is 38.
The spelling of 1054425333611 in words is "one trillion, fifty-four billion, four hundred twenty-five million, three hundred thirty-three thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •