Base | Representation |
---|---|
bin | 11101110000011101101… |
… | …10100111110100010101 |
3 | 10121202010101201112202121 |
4 | 32320032312213310111 |
5 | 113222440030310331 |
6 | 2101412510135541 |
7 | 133604204433235 |
oct | 16701666476425 |
9 | 3552111645677 |
10 | 1022451416341 |
11 | 36468a195333 |
12 | 1461a8ab15b1 |
13 | 755557c2094 |
14 | 376b6133cc5 |
15 | 1b8e2812c11 |
hex | ee0eda7d15 |
1022451416341 has 16 divisors (see below), whose sum is σ = 1077298084800. Its totient is φ = 967708598400.
The previous prime is 1022451416317. The next prime is 1022451416351. The reversal of 1022451416341 is 1436141542201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1022451416341 - 25 = 1022451416309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1022451416297 and 1022451416306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022451416351) 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 15 ways as a sum of consecutive naturals, for example, 113462526 + ... + 113471536.
It is an arithmetic number, because the mean of its divisors is an integer number (67331130300).
Almost surely, 21022451416341 is an apocalyptic number.
It is an amenable number.
1022451416341 is a deficient number, since it is larger than the sum of its proper divisors (54846668459).
1022451416341 is a wasteful number, since it uses less digits than its factorization.
1022451416341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14100.
The product of its (nonzero) digits is 23040, while the sum is 34.
Adding to 1022451416341 its reverse (1436141542201), we get a palindrome (2458592958542).
The spelling of 1022451416341 in words is "one trillion, twenty-two billion, four hundred fifty-one million, four hundred sixteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •