Base | Representation |
---|---|
bin | 111100000100000110… |
… | …1110011101101001111 |
3 | 110022221022112012201000 |
4 | 1320020031303231033 |
5 | 4103131113400041 |
6 | 135131123551343 |
7 | 12214262121360 |
oct | 1701015635517 |
9 | 408838465630 |
10 | 128986856271 |
11 | 4a780799269 |
12 | 20bb952b553 |
13 | c218014bc0 |
14 | 6358ad9b67 |
15 | 354de37bb6 |
hex | 1e08373b4f |
128986856271 has 96 divisors (see below), whose sum is σ = 248221317120. Its totient is φ = 64455683904.
The previous prime is 128986856267. The next prime is 128986856279. The reversal of 128986856271 is 172658689821.
128986856271 is a `hidden beast` number, since 1 + 2 + 8 + 9 + 8 + 68 + 562 + 7 + 1 = 666.
It is not a de Polignac number, because 128986856271 - 22 = 128986856267 is a prime.
It is a super-2 number, since 2×1289868562712 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a junction number, because it is equal to n+sod(n) for n = 128986856199 and 128986856208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128986856279) 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, 814266 + ... + 959688.
It is an arithmetic number, because the mean of its divisors is an integer number (2585638720).
Almost surely, 2128986856271 is an apocalyptic number.
128986856271 is a deficient number, since it is larger than the sum of its proper divisors (119234460849).
128986856271 is a wasteful number, since it uses less digits than its factorization.
128986856271 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145490 (or 145465 counting only the distinct ones).
The product of its digits is 23224320, while the sum is 63.
The spelling of 128986856271 in words is "one hundred twenty-eight billion, nine hundred eighty-six million, eight hundred fifty-six thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •