Base | Representation |
---|---|
bin | 11110101000100001100… |
… | …10111010010101000001 |
3 | 10201121210221012111000001 |
4 | 33110100302322111001 |
5 | 114221104441102324 |
6 | 2123311221000001 |
7 | 136021065630316 |
oct | 17242062722501 |
9 | 3647727174001 |
10 | 1052548769089 |
11 | 376424381984 |
12 | 14bba8553001 |
13 | 783410b1a4c |
14 | 38d2d480d0d |
15 | 1c5a4c6be44 |
hex | f510cba541 |
1052548769089 has 8 divisors (see below), whose sum is σ = 1088964659520. Its totient is φ = 1016140952400.
The previous prime is 1052548769071. The next prime is 1052548769123. The reversal of 1052548769089 is 9809678452501.
It is a happy number.
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 1052548769089 - 215 = 1052548736321 is a prime.
It is a super-2 number, since 2×10525487690892 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1052548769089.
It is not an unprimeable number, because it can be changed into a prime (1052548769189) 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, 1752597 + ... + 2275234.
It is an arithmetic number, because the mean of its divisors is an integer number (136120582440).
Almost surely, 21052548769089 is an apocalyptic number.
It is an amenable number.
1052548769089 is a deficient number, since it is larger than the sum of its proper divisors (36415890431).
1052548769089 is an equidigital number, since it uses as much as digits as its factorization.
1052548769089 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4036871.
The product of its (nonzero) digits is 43545600, while the sum is 64.
The spelling of 1052548769089 in words is "one trillion, fifty-two billion, five hundred forty-eight million, seven hundred sixty-nine thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •