Base | Representation |
---|---|
bin | 100101110100111… |
… | …0101111101011001 |
3 | 10021110100002120010 |
4 | 1023221311331121 |
5 | 10044412310441 |
6 | 325540352133 |
7 | 43311350553 |
oct | 11351657531 |
9 | 3243302503 |
10 | 1269260121 |
11 | 5a1511a08 |
12 | 2b50a5649 |
13 | 172c642bc |
14 | c07dc4d3 |
15 | 7666c116 |
hex | 4ba75f59 |
1269260121 has 16 divisors (see below), whose sum is σ = 1700100864. Its totient is φ = 842307024.
The previous prime is 1269260101. The next prime is 1269260141. The reversal of 1269260121 is 1210629621.
It is an interprime number because it is at equal distance from previous prime (1269260101) and next prime (1269260141).
It is not a de Polignac number, because 1269260121 - 210 = 1269259097 is a prime.
It is a super-2 number, since 2×12692601212 = 3222042509521869282, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1269260101) 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 15 ways as a sum of consecutive naturals, for example, 779310 + ... + 780936.
It is an arithmetic number, because the mean of its divisors is an integer number (106256304).
Almost surely, 21269260121 is an apocalyptic number.
It is an amenable number.
1269260121 is a deficient number, since it is larger than the sum of its proper divisors (430840743).
1269260121 is a wasteful number, since it uses less digits than its factorization.
1269260121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2660.
The product of its (nonzero) digits is 2592, while the sum is 30.
The square root of 1269260121 is about 35626.6770973662. The cubic root of 1269260121 is about 1082.7217930972.
Adding to 1269260121 its reverse (1210629621), we get a palindrome (2479889742).
The spelling of 1269260121 in words is "one billion, two hundred sixty-nine million, two hundred sixty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •