Base | Representation |
---|---|
bin | 11110101011011100010… |
… | …10001001010110111011 |
3 | 10201202212002121102101102 |
4 | 33111232022021112323 |
5 | 114232311434003201 |
6 | 2124130453442015 |
7 | 136104645601400 |
oct | 17255612112673 |
9 | 3652762542342 |
10 | 1054115141051 |
11 | 377058575365 |
12 | 15036504030b |
13 | 7853077236b |
14 | 3903b5002a7 |
15 | 1c64752726b |
hex | f56e2895bb |
1054115141051 has 12 divisors (see below), whose sum is σ = 1298345901048. Its totient is φ = 850378600512.
The previous prime is 1054115141039. The next prime is 1054115141089. The reversal of 1054115141051 is 1501415114501.
It is not a de Polignac number, because 1054115141051 - 210 = 1054115140027 is a prime.
It is a super-2 number, since 2×10541151410512 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1054115141011) 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 11 ways as a sum of consecutive naturals, for example, 632721341 + ... + 632723006.
It is an arithmetic number, because the mean of its divisors is an integer number (108195491754).
Almost surely, 21054115141051 is an apocalyptic number.
1054115141051 is a deficient number, since it is larger than the sum of its proper divisors (244230759997).
1054115141051 is a wasteful number, since it uses less digits than its factorization.
1054115141051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1265444378 (or 1265444371 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 29.
The spelling of 1054115141051 in words is "one trillion, fifty-four billion, one hundred fifteen million, one hundred forty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •