Base | Representation |
---|---|
bin | 11111000111101101000… |
… | …10111111110111101100 |
3 | 10210020000112111200022210 |
4 | 33203312202333313230 |
5 | 120004400243242202 |
6 | 2135120234210420 |
7 | 140152650144126 |
oct | 17436642776754 |
9 | 3706015450283 |
10 | 1069288259052 |
11 | 382534389502 |
12 | 15329a583a10 |
13 | 79aab1229b0 |
14 | 39a7a70a216 |
15 | 1cc34635c6c |
hex | f8f68bfdec |
1069288259052 has 96 divisors (see below), whose sum is σ = 2871085694400. Its totient is φ = 306817155072.
The previous prime is 1069288259023. The next prime is 1069288259111. The reversal of 1069288259052 is 2509528829601.
It is a super-2 number, since 2×10692882590522 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1069288258983 and 1069288259001.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1560477 + ... + 2138612.
It is an arithmetic number, because the mean of its divisors is an integer number (29907142650).
Almost surely, 21069288259052 is an apocalyptic number.
1069288259052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1069288259052 is an abundant number, since it is smaller than the sum of its proper divisors (1801797435348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1069288259052 is a wasteful number, since it uses less digits than its factorization.
1069288259052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3699235 (or 3699233 counting only the distinct ones).
The product of its (nonzero) digits is 6220800, while the sum is 57.
The spelling of 1069288259052 in words is "one trillion, sixty-nine billion, two hundred eighty-eight million, two hundred fifty-nine thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •