Base | Representation |
---|---|
bin | 11111110110111… |
… | …01111010001010 |
3 | 200121212120022000 |
4 | 33323131322022 |
5 | 1021403402432 |
6 | 42304011430 |
7 | 6423364323 |
oct | 1773357212 |
9 | 617776260 |
10 | 267247242 |
11 | 127943899 |
12 | 75600b76 |
13 | 434a0b82 |
14 | 276c944a |
15 | 186de57c |
hex | fedde8a |
267247242 has 64 divisors (see below), whose sum is σ = 636076800. Its totient is φ = 82874880.
The previous prime is 267247241. The next prime is 267247273. The reversal of 267247242 is 242742762.
It is a junction number, because it is equal to n+sod(n) for n = 267247197 and 267247206.
It is not an unprimeable number, because it can be changed into a prime (267247241) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 80067 + ... + 83337.
It is an arithmetic number, because the mean of its divisors is an integer number (9938700).
Almost surely, 2267247242 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 267247242, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (318038400).
267247242 is an abundant number, since it is smaller than the sum of its proper divisors (368829558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
267247242 is a wasteful number, since it uses less digits than its factorization.
267247242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3388 (or 3382 counting only the distinct ones).
The product of its digits is 75264, while the sum is 36.
The square root of 267247242 is about 16347.6983701070. The cubic root of 267247242 is about 644.1263672525.
The spelling of 267247242 in words is "two hundred sixty-seven million, two hundred forty-seven thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •