Base | Representation |
---|---|
bin | 11110101100011011010… |
… | …00001111001110111101 |
3 | 10201211012220002200122100 |
4 | 33112031220033032331 |
5 | 114234402114420013 |
6 | 2124255114135313 |
7 | 136124016430635 |
oct | 17261550171675 |
9 | 3654186080570 |
10 | 1054643123133 |
11 | 3772a9604096 |
12 | 150491a21539 |
13 | 785b5c73ab2 |
14 | 3908b69b6c5 |
15 | 1c678a6b473 |
hex | f58da0f3bd |
1054643123133 has 12 divisors (see below), whose sum is σ = 1523385489600. Its totient is φ = 703089835656.
The previous prime is 1054643123119. The next prime is 1054643123153. The reversal of 1054643123133 is 3313213464501.
1054643123133 is a `hidden beast` number, since 1 + 0 + 5 + 4 + 643 + 1 + 2 + 3 + 1 + 3 + 3 = 666.
It is not a de Polignac number, because 1054643123133 - 218 = 1054642860989 is a prime.
It is a super-2 number, since 2×10546431231332 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054643123153) 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, 962860 + ... + 1742522.
It is an arithmetic number, because the mean of its divisors is an integer number (126948790800).
Almost surely, 21054643123133 is an apocalyptic number.
It is an amenable number.
1054643123133 is a deficient number, since it is larger than the sum of its proper divisors (468742366467).
1054643123133 is a wasteful number, since it uses less digits than its factorization.
1054643123133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 929968 (or 929965 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 36.
Adding to 1054643123133 its reverse (3313213464501), we get a palindrome (4367856587634).
The spelling of 1054643123133 in words is "one trillion, fifty-four billion, six hundred forty-three million, one hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •