Base | Representation |
---|---|
bin | 111101001011101… |
… | …001001110110001 |
3 | 2122112110201000212 |
4 | 331023221032301 |
5 | 4100233301031 |
6 | 245504353505 |
7 | 34302534311 |
oct | 7513511661 |
9 | 2575421025 |
10 | 1026462641 |
11 | 487458636 |
12 | 247915895 |
13 | 134874059 |
14 | 9a479441 |
15 | 601ac12b |
hex | 3d2e93b1 |
1026462641 has 4 divisors (see below), whose sum is σ = 1034545152. Its totient is φ = 1018380132.
The previous prime is 1026462623. The next prime is 1026462643. The reversal of 1026462641 is 1462646201.
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.
It is a cyclic number.
It is not a de Polignac number, because 1026462641 - 222 = 1022268337 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1026462598 and 1026462607.
It is not an unprimeable number, because it can be changed into a prime (1026462643) 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 3 ways as a sum of consecutive naturals, for example, 4041065 + ... + 4041318.
It is an arithmetic number, because the mean of its divisors is an integer number (258636288).
Almost surely, 21026462641 is an apocalyptic number.
It is an amenable number.
1026462641 is a deficient number, since it is larger than the sum of its proper divisors (8082511).
1026462641 is an equidigital number, since it uses as much as digits as its factorization.
1026462641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8082510.
The product of its (nonzero) digits is 13824, while the sum is 32.
The square root of 1026462641 is about 32038.4556587861. The cubic root of 1026462641 is about 1008.7441964977.
The spelling of 1026462641 in words is "one billion, twenty-six million, four hundred sixty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •