Base | Representation |
---|---|
bin | 11110000110101010100… |
… | …00110010110101010001 |
3 | 10122212220000211102211111 |
4 | 33003111100302311101 |
5 | 113421342221204221 |
6 | 2111103313013321 |
7 | 134505440533600 |
oct | 17032520626521 |
9 | 3585800742744 |
10 | 1034370100561 |
11 | 369745a57186 |
12 | 148574554241 |
13 | 76704b55655 |
14 | 380c7025a37 |
15 | 1bd8dd6ebe1 |
hex | f0d5432d51 |
1034370100561 has 24 divisors (see below), whose sum is σ = 1274132621160. Its totient is φ = 834380047872.
The previous prime is 1034370100553. The next prime is 1034370100579. The reversal of 1034370100561 is 1650010734301.
It can be written as a sum of positive squares in 4 ways, for example, as 588413260561 + 445956840000 = 767081^2 + 667800^2 .
It is not a de Polignac number, because 1034370100561 - 23 = 1034370100553 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1034370100501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11441211 + ... + 11531263.
It is an arithmetic number, because the mean of its divisors is an integer number (53088859215).
Almost surely, 21034370100561 is an apocalyptic number.
It is an amenable number.
1034370100561 is a deficient number, since it is larger than the sum of its proper divisors (239762520599).
1034370100561 is a wasteful number, since it uses less digits than its factorization.
1034370100561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103873 (or 103866 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 31.
Adding to 1034370100561 its reverse (1650010734301), we get a palindrome (2684380834862).
The spelling of 1034370100561 in words is "one trillion, thirty-four billion, three hundred seventy million, one hundred thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •