Base | Representation |
---|---|
bin | 10000000011010… |
… | …100100010011101 |
3 | 200202202011101210 |
4 | 100003110202131 |
5 | 1022420243023 |
6 | 42420055033 |
7 | 6450030504 |
oct | 2003244235 |
9 | 622664353 |
10 | 269306013 |
11 | 12901a659 |
12 | 76234479 |
13 | 43a41c92 |
14 | 27aa383b |
15 | 18999593 |
hex | 100d489d |
269306013 has 8 divisors (see below), whose sum is σ = 359740576. Its totient is φ = 179204400.
The previous prime is 269306003. The next prime is 269306029. The reversal of 269306013 is 310603962.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 269306013 - 24 = 269305997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (269306003) 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, 81343 + ... + 84588.
It is an arithmetic number, because the mean of its divisors is an integer number (44967572).
Almost surely, 2269306013 is an apocalyptic number.
It is an amenable number.
269306013 is a deficient number, since it is larger than the sum of its proper divisors (90434563).
269306013 is a wasteful number, since it uses less digits than its factorization.
269306013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166475.
The product of its (nonzero) digits is 5832, while the sum is 30.
The square root of 269306013 is about 16410.5457861706. The cubic root of 269306013 is about 645.7761727484.
Adding to 269306013 its reverse (310603962), we get a palindrome (579909975).
It can be divided in two parts, 26 and 9306013, that added together give a palindrome (9306039).
The spelling of 269306013 in words is "two hundred sixty-nine million, three hundred six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •