Base | Representation |
---|---|
bin | 10000011110111… |
… | …01110000011010 |
3 | 100122011221012200 |
4 | 20033131300122 |
5 | 240344144040 |
6 | 21415351030 |
7 | 3266201460 |
oct | 1017356032 |
9 | 318157180 |
10 | 138271770 |
11 | 7106169a |
12 | 3a382476 |
13 | 22853820 |
14 | 14514830 |
15 | c214630 |
hex | 83ddc1a |
138271770 has 96 divisors (see below), whose sum is σ = 442495872. Its totient is φ = 29172096.
The previous prime is 138271741. The next prime is 138271781. The reversal of 138271770 is 77172831.
It is a happy number.
138271770 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 252 + ... + 16631.
It is an arithmetic number, because the mean of its divisors is an integer number (4609332).
Almost surely, 2138271770 is an apocalyptic number.
138271770 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 138271770, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (221247936).
138271770 is an abundant number, since it is smaller than the sum of its proper divisors (304224102).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138271770 is a wasteful number, since it uses less digits than its factorization.
138271770 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16916 (or 16913 counting only the distinct ones).
The product of its (nonzero) digits is 16464, while the sum is 36.
The square root of 138271770 is about 11758.9017344308. The cubic root of 138271770 is about 517.1039327531.
The spelling of 138271770 in words is "one hundred thirty-eight million, two hundred seventy-one thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •