Base | Representation |
---|---|
bin | 11101010000111001001110… |
… | …100110100000101100000001 |
3 | 121212201000022120020222200220 |
4 | 131100321032212200230001 |
5 | 113332142411012211040 |
6 | 1133421535420533253 |
7 | 36052402515361200 |
oct | 3520711646405401 |
9 | 555630276228626 |
10 | 128704308710145 |
11 | 38011210a52813 |
12 | 125279106b1229 |
13 | 56a79c203999c |
14 | 23ad470d67237 |
15 | ed2d63a782d0 |
hex | 750e4e9a0b01 |
128704308710145 has 96 divisors (see below), whose sum is σ = 241757647971840. Its totient is φ = 58293494622720.
The previous prime is 128704308710141. The next prime is 128704308710189. The reversal of 128704308710145 is 541017803407821.
It is not a de Polignac number, because 128704308710145 - 22 = 128704308710141 is a prime.
It is a super-2 number, since 2×1287043087101452 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (128704308710141) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2580719560 + ... + 2580769430.
It is an arithmetic number, because the mean of its divisors is an integer number (2518308833040).
Almost surely, 2128704308710145 is an apocalyptic number.
128704308710145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
128704308710145 is a deficient number, since it is larger than the sum of its proper divisors (113053339261695).
128704308710145 is a wasteful number, since it uses less digits than its factorization.
128704308710145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82215 (or 82208 counting only the distinct ones).
The product of its (nonzero) digits is 1505280, while the sum is 51.
The spelling of 128704308710145 in words is "one hundred twenty-eight trillion, seven hundred four billion, three hundred eight million, seven hundred ten thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •