Base | Representation |
---|---|
bin | 101000010101110… |
… | …1110111010101001 |
3 | 10111100010010020121 |
4 | 1100223232322221 |
5 | 10233013013031 |
6 | 342153123241 |
7 | 45354523042 |
oct | 12053567251 |
9 | 3440103217 |
10 | 1353641641 |
11 | 635106000 |
12 | 3193b9521 |
13 | 187599ab1 |
14 | cbac58c9 |
15 | 7dc89011 |
hex | 50aeeea9 |
1353641641 has 8 divisors (see below), whose sum is σ = 1488905568. Its totient is φ = 1230582100.
The previous prime is 1353641621. The next prime is 1353641647. The reversal of 1353641641 is 1461463531.
It is not a de Polignac number, because 1353641641 - 29 = 1353641129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1353641597 and 1353641606.
It is not an unprimeable number, because it can be changed into a prime (1353641647) 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 7 ways as a sum of consecutive naturals, for example, 507175 + ... + 509836.
It is an arithmetic number, because the mean of its divisors is an integer number (186113196).
Almost surely, 21353641641 is an apocalyptic number.
1353641641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1353641641 is a deficient number, since it is larger than the sum of its proper divisors (135263927).
1353641641 is an equidigital number, since it uses as much as digits as its factorization.
1353641641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1017044 (or 1017022 counting only the distinct ones).
The product of its digits is 25920, while the sum is 34.
The square root of 1353641641 is about 36791.8692240555. The cubic root of 1353641641 is about 1106.2023292214.
The spelling of 1353641641 in words is "one billion, three hundred fifty-three million, six hundred forty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •