Base | Representation |
---|---|
bin | 10000001110101… |
… | …000010001010101 |
3 | 200222022202210200 |
4 | 100032220101111 |
5 | 1024200123141 |
6 | 43003411113 |
7 | 6514155213 |
oct | 2016502125 |
9 | 628282720 |
10 | 272270421 |
11 | 12a764885 |
12 | 77223a99 |
13 | 4453c377 |
14 | 28235cb3 |
15 | 18d82ab6 |
hex | 103a8455 |
272270421 has 6 divisors (see below), whose sum is σ = 393279510. Its totient is φ = 181513608.
The previous prime is 272270417. The next prime is 272270431. The reversal of 272270421 is 124072272.
It can be written as a sum of positive squares in only one way, i.e., 244296900 + 27973521 = 15630^2 + 5289^2 .
It is not a de Polignac number, because 272270421 - 22 = 272270417 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (272270431) 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 5 ways as a sum of consecutive naturals, for example, 15126126 + ... + 15126143.
It is an arithmetic number, because the mean of its divisors is an integer number (65546585).
Almost surely, 2272270421 is an apocalyptic number.
It is an amenable number.
272270421 is a deficient number, since it is larger than the sum of its proper divisors (121009089).
272270421 is a wasteful number, since it uses less digits than its factorization.
272270421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30252275 (or 30252272 counting only the distinct ones).
The product of its (nonzero) digits is 3136, while the sum is 27.
The square root of 272270421 is about 16500.6188065781. The cubic root of 272270421 is about 648.1370094954.
It can be divided in two parts, 272270 and 421, that added together give a triangular number (272691 = T738).
The spelling of 272270421 in words is "two hundred seventy-two million, two hundred seventy thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •