Base | Representation |
---|---|
bin | 11111101010110111010… |
… | …01001100000110010001 |
3 | 10212000202001000101000200 |
4 | 33311123221030012101 |
5 | 120312030022000001 |
6 | 2151521252205413 |
7 | 141421503340533 |
oct | 17653351140621 |
9 | 3760661011020 |
10 | 1088164250001 |
11 | 38a540394924 |
12 | 156a88009869 |
13 | 7b7c89917ca |
14 | 3a94b603853 |
15 | 1d48b877086 |
hex | fd5ba4c191 |
1088164250001 has 6 divisors (see below), whose sum is σ = 1571792805570. Its totient is φ = 725442833328.
The previous prime is 1088164249981. The next prime is 1088164250009. The reversal of 1088164250001 is 1000524618801.
1088164250001 is a `hidden beast` number, since 1 + 0 + 8 + 8 + 1 + 642 + 5 + 0 + 0 + 0 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 769164080400 + 319000169601 = 877020^2 + 564801^2 .
It is not a de Polignac number, because 1088164250001 - 227 = 1088030032273 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1088164250009) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 60453569436 + ... + 60453569453.
It is an arithmetic number, because the mean of its divisors is an integer number (261965467595).
Almost surely, 21088164250001 is an apocalyptic number.
It is an amenable number.
1088164250001 is a deficient number, since it is larger than the sum of its proper divisors (483628555569).
1088164250001 is a wasteful number, since it uses less digits than its factorization.
1088164250001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120907138895 (or 120907138892 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 36.
Adding to 1088164250001 its reverse (1000524618801), we get a palindrome (2088688868802).
The spelling of 1088164250001 in words is "one trillion, eighty-eight billion, one hundred sixty-four million, two hundred fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •