Base | Representation |
---|---|
bin | 10111111000100000011… |
… | …101101000010000010001 |
3 | 12210220021121000102021220 |
4 | 113320200131220100101 |
5 | 203342210332120131 |
6 | 3253544514235253 |
7 | 226401005024643 |
oct | 27704035502021 |
9 | 5726247012256 |
10 | 1641222145041 |
11 | 583047129156 |
12 | 2260b5b85b29 |
13 | bb9c725463b |
14 | 59615310893 |
15 | 2ca5a52ce96 |
hex | 17e20768411 |
1641222145041 has 12 divisors (see below), whose sum is σ = 2287576174128. Its totient is φ = 1046576439304.
The previous prime is 1641222145007. The next prime is 1641222145099. The reversal of 1641222145041 is 1405412221461.
It is not a de Polignac number, because 1641222145041 - 238 = 1366344238097 is a prime.
It is a super-2 number, since 2×16412221450412 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1641222144993 and 1641222145011.
It is not an unprimeable number, because it can be changed into a prime (1641222145141) 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 11 ways as a sum of consecutive naturals, for example, 517081635 + ... + 517084808.
It is an arithmetic number, because the mean of its divisors is an integer number (190631347844).
Almost surely, 21641222145041 is an apocalyptic number.
It is an amenable number.
1641222145041 is a deficient number, since it is larger than the sum of its proper divisors (646354029087).
1641222145041 is a wasteful number, since it uses less digits than its factorization.
1641222145041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1034166492 (or 1034166469 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 33.
The spelling of 1641222145041 in words is "one trillion, six hundred forty-one billion, two hundred twenty-two million, one hundred forty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •