Base | Representation |
---|---|
bin | 101010100000001… |
… | …0100000101101001 |
3 | 10200101112201000221 |
4 | 1111000110011221 |
5 | 10410043130031 |
6 | 353303130041 |
7 | 50225016004 |
oct | 12500240551 |
9 | 3611481027 |
10 | 1426145641 |
11 | 672027368 |
12 | 339743921 |
13 | 19960427b |
14 | d759a53b |
15 | 8530ba11 |
hex | 55014169 |
1426145641 has 4 divisors (see below), whose sum is σ = 1431568512. Its totient is φ = 1420722772.
The previous prime is 1426145533. The next prime is 1426145647. The reversal of 1426145641 is 1465416241.
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 1426145641 - 215 = 1426112873 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1426145597 and 1426145606.
It is not an unprimeable number, because it can be changed into a prime (1426145647) 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 3 ways as a sum of consecutive naturals, for example, 2711041 + ... + 2711566.
It is an arithmetic number, because the mean of its divisors is an integer number (357892128).
Almost surely, 21426145641 is an apocalyptic number.
It is an amenable number.
1426145641 is a deficient number, since it is larger than the sum of its proper divisors (5422871).
1426145641 is an equidigital number, since it uses as much as digits as its factorization.
1426145641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5422870.
The product of its digits is 23040, while the sum is 34.
The square root of 1426145641 is about 37764.3435134255. The cubic root of 1426145641 is about 1125.6100437216.
The spelling of 1426145641 in words is "one billion, four hundred twenty-six million, one hundred forty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •