Base | Representation |
---|---|
bin | 11110101110000101011… |
… | …01111010101001111001 |
3 | 10201220111222001222022021 |
4 | 33113002231322221321 |
5 | 114243213123213103 |
6 | 2124523332354441 |
7 | 136155053204413 |
oct | 17270255725171 |
9 | 3656458058267 |
10 | 1055533804153 |
11 | 377716350a04 |
12 | 1506a0175a21 |
13 | 786c865689a |
14 | 39133aad9b3 |
15 | 1c6cbd56bbd |
hex | f5c2b7aa79 |
1055533804153 has 8 divisors (see below), whose sum is σ = 1080118670400. Its totient is φ = 1030950645648.
The previous prime is 1055533804123. The next prime is 1055533804163. The reversal of 1055533804153 is 3514083355501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1055533804153 - 213 = 1055533795961 is a prime.
It is a super-3 number, since 3×10555338041533 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1055533804123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 868908 + ... + 1692946.
It is an arithmetic number, because the mean of its divisors is an integer number (135014833800).
Almost surely, 21055533804153 is an apocalyptic number.
It is an amenable number.
1055533804153 is a deficient number, since it is larger than the sum of its proper divisors (24584866247).
1055533804153 is an equidigital number, since it uses as much as digits as its factorization.
1055533804153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 853871.
The product of its (nonzero) digits is 540000, while the sum is 43.
The spelling of 1055533804153 in words is "one trillion, fifty-five billion, five hundred thirty-three million, eight hundred four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •