Base | Representation |
---|---|
bin | 10000100001110… |
… | …11110100010101 |
3 | 100122220111201010 |
4 | 20100323310111 |
5 | 240444011140 |
6 | 21431522433 |
7 | 3302364642 |
oct | 1020736425 |
9 | 318814633 |
10 | 138657045 |
11 | 712a50aa |
12 | 3a529419 |
13 | 22959cb7 |
14 | 145b4dc9 |
15 | c28d880 |
hex | 843bd15 |
138657045 has 16 divisors (see below), whose sum is σ = 222785280. Its totient is φ = 73639104.
The previous prime is 138657007. The next prime is 138657073. The reversal of 138657045 is 540756831.
It is not a de Polignac number, because 138657045 - 28 = 138656789 is a prime.
It is a super-2 number, since 2×1386570452 = 38451552256264050, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 138656994 and 138657012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15754 + ... + 22923.
It is an arithmetic number, because the mean of its divisors is an integer number (13924080).
Almost surely, 2138657045 is an apocalyptic number.
138657045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
138657045 is a deficient number, since it is larger than the sum of its proper divisors (84128235).
138657045 is a wasteful number, since it uses less digits than its factorization.
138657045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38924.
The product of its (nonzero) digits is 100800, while the sum is 39.
The square root of 138657045 is about 11775.2726083093. The cubic root of 138657045 is about 517.5837666917.
It can be divided in two parts, 13865 and 7045, that added together give a triangular number (20910 = T204).
The spelling of 138657045 in words is "one hundred thirty-eight million, six hundred fifty-seven thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •