Base | Representation |
---|---|
bin | 11110101010011101110… |
… | …00001100101000001101 |
3 | 10201201111112002212122100 |
4 | 33111032320030220031 |
5 | 114230223111422112 |
6 | 2124002425305313 |
7 | 136055644100433 |
oct | 17251670145015 |
9 | 3651445085570 |
10 | 1053590342157 |
11 | 376909310171 |
12 | 150239335239 |
13 | 78478b16782 |
14 | 38dcb930d53 |
15 | 1c6164112dc |
hex | f54ee0ca0d |
1053590342157 has 12 divisors (see below), whose sum is σ = 1525999458880. Its totient is φ = 700479680328.
The previous prime is 1053590342117. The next prime is 1053590342159. The reversal of 1053590342157 is 7512430953501.
1053590342157 is a `hidden beast` number, since 1 + 0 + 5 + 3 + 590 + 3 + 4 + 2 + 1 + 57 = 666.
1053590342157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1053590342157 - 218 = 1053590080013 is a prime.
It is a super-2 number, since 2×10535903421572 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053590342159) 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, 159486607 + ... + 159493212.
Almost surely, 21053590342157 is an apocalyptic number.
It is an amenable number.
1053590342157 is a deficient number, since it is larger than the sum of its proper divisors (472409116723).
1053590342157 is a wasteful number, since it uses less digits than its factorization.
1053590342157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 318980192 (or 318980189 counting only the distinct ones).
The product of its (nonzero) digits is 567000, while the sum is 45.
The spelling of 1053590342157 in words is "one trillion, fifty-three billion, five hundred ninety million, three hundred forty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •