Base | Representation |
---|---|
bin | 11111110111000… |
… | …11111101010100 |
3 | 200121220211021201 |
4 | 33323203331110 |
5 | 1021410201040 |
6 | 42304322244 |
7 | 6423526501 |
oct | 1773437524 |
9 | 617824251 |
10 | 267272020 |
11 | 127960474 |
12 | 75613384 |
13 | 434ac232 |
14 | 276d44a8 |
15 | 186e6a9a |
hex | fee3f54 |
267272020 has 12 divisors (see below), whose sum is σ = 561271284. Its totient is φ = 106908800.
The previous prime is 267272017. The next prime is 267272041. The reversal of 267272020 is 20272762.
It can be written as a sum of positive squares in 2 ways, for example, as 200392336 + 66879684 = 14156^2 + 8178^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 267272020.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6681781 + ... + 6681820.
It is an arithmetic number, because the mean of its divisors is an integer number (46772607).
Almost surely, 2267272020 is an apocalyptic number.
267272020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
267272020 is an abundant number, since it is smaller than the sum of its proper divisors (293999264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
267272020 is a wasteful number, since it uses less digits than its factorization.
267272020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13363610 (or 13363608 counting only the distinct ones).
The product of its (nonzero) digits is 4704, while the sum is 28.
The square root of 267272020 is about 16348.4561962284. The cubic root of 267272020 is about 644.1462735008.
The spelling of 267272020 in words is "two hundred sixty-seven million, two hundred seventy-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •