Base | Representation |
---|---|
bin | 1111010110101… |
… | …11110100001010 |
3 | 22222101020110000 |
4 | 13223113310022 |
5 | 230433412000 |
6 | 20440503430 |
7 | 3122604042 |
oct | 753276412 |
9 | 288336400 |
10 | 128810250 |
11 | 6678a058 |
12 | 3717ab76 |
13 | 208c00aa |
14 | 13170722 |
15 | b496000 |
hex | 7ad7d0a |
128810250 has 80 divisors (see below), whose sum is σ = 360267336. Its totient is φ = 34344000.
The previous prime is 128810243. The next prime is 128810251. The reversal of 128810250 is 52018821.
It can be written as a sum of positive squares in 4 ways, for example, as 23357889 + 105452361 = 4833^2 + 10269^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (128810251) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 17070 + ... + 23430.
Almost surely, 2128810250 is an apocalyptic number.
128810250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 128810250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180133668).
128810250 is an abundant number, since it is smaller than the sum of its proper divisors (231457086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128810250 is an equidigital number, since it uses as much as digits as its factorization.
128810250 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6390 (or 6371 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 27.
The square root of 128810250 is about 11349.4603395932. The cubic root of 128810250 is about 505.0295705326.
The spelling of 128810250 in words is "one hundred twenty-eight million, eight hundred ten thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •