Base | Representation |
---|---|
bin | 1010001001101101… |
… | …1010101011001010 |
3 | 21000220202020010121 |
4 | 2202123122223022 |
5 | 21040111034023 |
6 | 1130224133454 |
7 | 124346635462 |
oct | 24233325312 |
9 | 7026666117 |
10 | 2725096138 |
11 | 1179278076 |
12 | 64076728a |
13 | 34576262b |
14 | 1bbcc6ba2 |
15 | 10e390d5d |
hex | a26daaca |
2725096138 has 8 divisors (see below), whose sum is σ = 4125145860. Its totient is φ = 1350047520.
The previous prime is 2725096133. The next prime is 2725096169. The reversal of 2725096138 is 8316905272.
2725096138 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 2447973529 + 277122609 = 49477^2 + 16647^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×27250961382 = 14852297922685030088, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2725096094 and 2725096103.
It is not an unprimeable number, because it can be changed into a prime (2725096133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6250003 + ... + 6250438.
Almost surely, 22725096138 is an apocalyptic number.
2725096138 is a deficient number, since it is larger than the sum of its proper divisors (1400049722).
2725096138 is a wasteful number, since it uses less digits than its factorization.
2725096138 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12500552.
The product of its (nonzero) digits is 181440, while the sum is 43.
The square root of 2725096138 is about 52202.4533714652. The cubic root of 2725096138 is about 1396.7776463426. Note that the first 3 decimals are identical.
The spelling of 2725096138 in words is "two billion, seven hundred twenty-five million, ninety-six thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •