Base | Representation |
---|---|
bin | 101000010111110… |
… | …0011010011101101 |
3 | 10111101222222101201 |
4 | 1100233203103231 |
5 | 10233242031134 |
6 | 342230405501 |
7 | 45366162352 |
oct | 12057432355 |
9 | 3441888351 |
10 | 1354642669 |
11 | 63572a0a6 |
12 | 319800891 |
13 | 18785a613 |
14 | cbca6629 |
15 | 7ddd5914 |
hex | 50be34ed |
1354642669 has 2 divisors, whose sum is σ = 1354642670. Its totient is φ = 1354642668.
The previous prime is 1354642657. The next prime is 1354642721. The reversal of 1354642669 is 9662464531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 825872644 + 528770025 = 28738^2 + 22995^2 .
It is a cyclic number.
It is not a de Polignac number, because 1354642669 - 215 = 1354609901 is a prime.
It is a super-2 number, since 2×13546426692 = 3670113521350887122, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1354642369) 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 as a sum of consecutive naturals, namely, 677321334 + 677321335.
It is an arithmetic number, because the mean of its divisors is an integer number (677321335).
Almost surely, 21354642669 is an apocalyptic number.
It is an amenable number.
1354642669 is a deficient number, since it is larger than the sum of its proper divisors (1).
1354642669 is an equidigital number, since it uses as much as digits as its factorization.
1354642669 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 933120, while the sum is 46.
The square root of 1354642669 is about 36805.4706395666. The cubic root of 1354642669 is about 1106.4749436322.
The spelling of 1354642669 in words is "one billion, three hundred fifty-four million, six hundred forty-two thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •