Base | Representation |
---|---|
bin | 10111111100011010011… |
… | …100011110001000110101 |
3 | 12211022002212202201021210 |
4 | 113330122130132020311 |
5 | 203424303013123321 |
6 | 3255521014232033 |
7 | 226606642320264 |
oct | 27743234361065 |
9 | 5738085681253 |
10 | 1645416145461 |
11 | 5848a9577800 |
12 | 226a86655619 |
13 | bc21510c5aa |
14 | 598d23245db |
15 | 2cc03824b76 |
hex | 17f1a71e235 |
1645416145461 has 24 divisors (see below), whose sum is σ = 2412036085312. Its totient is φ = 996985281600.
The previous prime is 1645416145427. The next prime is 1645416145531.
It is a happy number.
1645416145461 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-1645416145461 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1645416145461.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1645416145861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1000185 + ... + 2071521.
Almost surely, 21645416145461 is an apocalyptic number.
1645416145461 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1645416145461 is a deficient number, since it is larger than the sum of its proper divisors (766619939851).
1645416145461 is a wasteful number, since it uses less digits than its factorization.
1645416145461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1075593 (or 1075582 counting only the distinct ones).
The product of its digits is 1382400, while the sum is 48.
The spelling of 1645416145461 in words is "one trillion, six hundred forty-five billion, four hundred sixteen million, one hundred forty-five thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •