Base | Representation |
---|---|
bin | 101001011001010… |
… | …1110001110101101 |
3 | 10120210200221120110 |
4 | 1102302232032231 |
5 | 10321042401034 |
6 | 345455410233 |
7 | 46264355046 |
oct | 12262561655 |
9 | 3523627513 |
10 | 1389028269 |
11 | 653085552 |
12 | 329223979 |
13 | 191a09825 |
14 | d26978cd |
15 | 81e28de9 |
hex | 52cae3ad |
1389028269 has 16 divisors (see below), whose sum is σ = 1994854400. Its totient is φ = 856877616.
The previous prime is 1389028237. The next prime is 1389028273. The reversal of 1389028269 is 9628209831.
It is not a de Polignac number, because 1389028269 - 25 = 1389028237 is a prime.
It is a super-2 number, since 2×13890282692 = 3858799064162272722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1389028229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 280909 + ... + 285810.
It is an arithmetic number, because the mean of its divisors is an integer number (124678400).
Almost surely, 21389028269 is an apocalyptic number.
1389028269 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
1389028269 is a deficient number, since it is larger than the sum of its proper divisors (605826131).
1389028269 is a wasteful number, since it uses less digits than its factorization.
1389028269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566784.
The product of its (nonzero) digits is 373248, while the sum is 48.
The square root of 1389028269 is about 37269.6695585029. The cubic root of 1389028269 is about 1115.7589044775.
The spelling of 1389028269 in words is "one billion, three hundred eighty-nine million, twenty-eight thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •