Base | Representation |
---|---|
bin | 10000000011110… |
… | …010011001110101 |
3 | 200202222101012110 |
4 | 100003302121311 |
5 | 1022433201331 |
6 | 42422441233 |
7 | 6451050240 |
oct | 2003623165 |
9 | 622871173 |
10 | 269428341 |
11 | 1290a3556 |
12 | 76293219 |
13 | 43a85870 |
14 | 27ad6257 |
15 | 189c0946 |
hex | 100f2675 |
269428341 has 64 divisors (see below), whose sum is σ = 470220800. Its totient is φ = 133249536.
The previous prime is 269428333. The next prime is 269428351. The reversal of 269428341 is 143824962.
It is not a de Polignac number, because 269428341 - 23 = 269428333 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 269428341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (269428321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 658545 + ... + 658953.
It is an arithmetic number, because the mean of its divisors is an integer number (7347200).
Almost surely, 2269428341 is an apocalyptic number.
269428341 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
269428341 is a deficient number, since it is larger than the sum of its proper divisors (200792459).
269428341 is a wasteful number, since it uses less digits than its factorization.
269428341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 578.
The product of its digits is 82944, while the sum is 39.
The square root of 269428341 is about 16414.2724785474. The cubic root of 269428341 is about 645.8739358208.
The spelling of 269428341 in words is "two hundred sixty-nine million, four hundred twenty-eight thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •