Base | Representation |
---|---|
bin | 10000100010000… |
… | …11101110110100 |
3 | 100122222011011200 |
4 | 20101003232310 |
5 | 241001030320 |
6 | 21432332500 |
7 | 3302561310 |
oct | 1021035664 |
9 | 318864150 |
10 | 138689460 |
11 | 71317498 |
12 | 3a544130 |
13 | 2296b990 |
14 | 145c2b40 |
15 | c298290 |
hex | 8443bb4 |
138689460 has 144 divisors (see below), whose sum is σ = 517835136. Its totient is φ = 29258496.
The previous prime is 138689449. The next prime is 138689479. The reversal of 138689460 is 64986831.
138689460 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
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, 12147 + ... + 20613.
Almost surely, 2138689460 is an apocalyptic number.
138689460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 138689460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (258917568).
138689460 is an abundant number, since it is smaller than the sum of its proper divisors (379145676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138689460 is a wasteful number, since it uses less digits than its factorization.
138689460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8502 (or 8497 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 45.
The square root of 138689460 is about 11776.6489291309. The cubic root of 138689460 is about 517.6240968232.
The spelling of 138689460 in words is "one hundred thirty-eight million, six hundred eighty-nine thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •