Base | Representation |
---|---|
bin | 10000100000000… |
… | …11100001100110 |
3 | 100122110210102022 |
4 | 20100003201212 |
5 | 240414121340 |
6 | 21422543142 |
7 | 3300414500 |
oct | 1020034146 |
9 | 318423368 |
10 | 138426470 |
11 | 71157946 |
12 | 3a437ab2 |
13 | 228a9070 |
14 | 14554d70 |
15 | c2453b5 |
hex | 8403866 |
138426470 has 96 divisors (see below), whose sum is σ = 322672896. Its totient is φ = 42336000.
The previous prime is 138426413. The next prime is 138426493. The reversal of 138426470 is 74624831.
138426470 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 (35).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 138426470.
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, 197120 + ... + 197820.
It is an arithmetic number, because the mean of its divisors is an integer number (3361176).
Almost surely, 2138426470 is an apocalyptic number.
138426470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
138426470 is an abundant number, since it is smaller than the sum of its proper divisors (184246426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138426470 is a wasteful number, since it uses less digits than its factorization.
138426470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 766 (or 759 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 35.
The square root of 138426470 is about 11765.4778908466. The cubic root of 138426470 is about 517.2967080956.
The spelling of 138426470 in words is "one hundred thirty-eight million, four hundred twenty-six thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •