Base | Representation |
---|---|
bin | 11101101111111010100… |
… | …01100010010100001111 |
3 | 10121201100211202022122100 |
4 | 32313331101202110033 |
5 | 113221334024404212 |
6 | 2101323332450143 |
7 | 133563663511626 |
oct | 16677521422417 |
9 | 3551324668570 |
10 | 1022156481807 |
11 | 36454876068a |
12 | 146126179953 |
13 | 75509678ac6 |
14 | 37688cbc6bd |
15 | 1b8c69a4bdc |
hex | edfd46250f |
1022156481807 has 24 divisors (see below), whose sum is σ = 1563446607840. Its totient is φ = 641292180480.
The previous prime is 1022156481791. The next prime is 1022156481809. The reversal of 1022156481807 is 7081846512201.
1022156481807 is a `hidden beast` number, since 1 + 0 + 2 + 2 + 1 + 564 + 8 + 1 + 80 + 7 = 666.
It is not a de Polignac number, because 1022156481807 - 24 = 1022156481791 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022156481809) 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, 1326919 + ... + 1950647.
It is an arithmetic number, because the mean of its divisors is an integer number (65143608660).
Almost surely, 21022156481807 is an apocalyptic number.
1022156481807 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
1022156481807 is a deficient number, since it is larger than the sum of its proper divisors (541290126033).
1022156481807 is a wasteful number, since it uses less digits than its factorization.
1022156481807 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 634463 (or 634460 counting only the distinct ones).
The product of its (nonzero) digits is 215040, while the sum is 45.
The spelling of 1022156481807 in words is "one trillion, twenty-two billion, one hundred fifty-six million, four hundred eighty-one thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •