Base | Representation |
---|---|
bin | 11110101011001110110… |
… | …11100011100001100001 |
3 | 10201202120020012200101212 |
4 | 33111213123203201201 |
5 | 114232044034423121 |
6 | 2124111342235505 |
7 | 136102105265300 |
oct | 17254733434141 |
9 | 3652506180355 |
10 | 1054002264161 |
11 | 376aaa889280 |
12 | 150333285b95 |
13 | 785132706c2 |
14 | 3902a51a437 |
15 | 1c63c67c25b |
hex | f5676e3861 |
1054002264161 has 12 divisors (see below), whose sum is σ = 1337546473200. Its totient is φ = 821300465160.
The previous prime is 1054002264113. The next prime is 1054002264167. The reversal of 1054002264161 is 1614622004501.
It is a de Polignac number, because none of the positive numbers 2k-1054002264161 is a prime.
It is a super-2 number, since 2×10540022641612 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1054002264167) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 977738111 + ... + 977739188.
It is an arithmetic number, because the mean of its divisors is an integer number (111462206100).
Almost surely, 21054002264161 is an apocalyptic number.
1054002264161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1054002264161 is a deficient number, since it is larger than the sum of its proper divisors (283544209039).
1054002264161 is a wasteful number, since it uses less digits than its factorization.
1054002264161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1955477324 (or 1955477317 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 1054002264161 its reverse (1614622004501), we get a palindrome (2668624268662).
The spelling of 1054002264161 in words is "one trillion, fifty-four billion, two million, two hundred sixty-four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •