Base | Representation |
---|---|
bin | 111101001010110… |
… | …100001110001001 |
3 | 2122112001200012002 |
4 | 331022310032021 |
5 | 4100204324023 |
6 | 245500000345 |
7 | 34300641266 |
oct | 7512641611 |
9 | 2575050162 |
10 | 1026245513 |
11 | 48731a497 |
12 | 2478300b5 |
13 | 1347c9287 |
14 | 9a42026d |
15 | 60167b28 |
hex | 3d2b4389 |
1026245513 has 4 divisors (see below), whose sum is σ = 1026926208. Its totient is φ = 1025564820.
The previous prime is 1026245509. The next prime is 1026245527. The reversal of 1026245513 is 3155426201.
1026245513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3155426201 = 439 ⋅7187759.
It is a cyclic number.
It is not a de Polignac number, because 1026245513 - 22 = 1026245509 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1026245113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 338081 + ... + 341102.
It is an arithmetic number, because the mean of its divisors is an integer number (256731552).
Almost surely, 21026245513 is an apocalyptic number.
It is an amenable number.
1026245513 is a deficient number, since it is larger than the sum of its proper divisors (680695).
1026245513 is an equidigital number, since it uses as much as digits as its factorization.
1026245513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680694.
The product of its (nonzero) digits is 7200, while the sum is 29.
The square root of 1026245513 is about 32035.0669267289. The cubic root of 1026245513 is about 1008.6730648115.
The spelling of 1026245513 in words is "one billion, twenty-six million, two hundred forty-five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •