Base | Representation |
---|---|
bin | 10000000110011… |
… | …101101000000101 |
3 | 200211022000020120 |
4 | 100012131220011 |
5 | 1023123122134 |
6 | 42445452153 |
7 | 6460031025 |
oct | 2006355005 |
9 | 624260216 |
10 | 270129669 |
11 | 129532467 |
12 | 76571059 |
13 | 43c6cb54 |
14 | 27c39a85 |
15 | 18aad649 |
hex | 1019da05 |
270129669 has 8 divisors (see below), whose sum is σ = 379129440. Its totient is φ = 170608176.
The previous prime is 270129661. The next prime is 270129701. The reversal of 270129669 is 966921072.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 270129669 - 23 = 270129661 is a prime.
It is a super-2 number, since 2×2701296692 = 145940076148099122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 270129669.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (270129661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2369502 + ... + 2369615.
It is an arithmetic number, because the mean of its divisors is an integer number (47391180).
Almost surely, 2270129669 is an apocalyptic number.
It is an amenable number.
270129669 is a deficient number, since it is larger than the sum of its proper divisors (108999771).
270129669 is a wasteful number, since it uses less digits than its factorization.
270129669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4739139.
The product of its (nonzero) digits is 81648, while the sum is 42.
The square root of 270129669 is about 16435.6219535496. The cubic root of 270129669 is about 646.4338583732.
The spelling of 270129669 in words is "two hundred seventy million, one hundred twenty-nine thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •