Base | Representation |
---|---|
bin | 11101101100000101101… |
… | …00011001001111010000 |
3 | 10121112001122220221201221 |
4 | 32312002310121033100 |
5 | 113203132104201341 |
6 | 2100343422334424 |
7 | 133462036056313 |
oct | 16660264311720 |
9 | 3545048827657 |
10 | 1020102022096 |
11 | 363693aa76a3 |
12 | 14585212a414 |
13 | 7526cb44481 |
14 | 375320c897a |
15 | 1b806435ed1 |
hex | ed82d193d0 |
1020102022096 has 20 divisors (see below), whose sum is σ = 2001465995200. Its totient is φ = 503594668512.
The previous prime is 1020102022091. The next prime is 1020102022157. The reversal of 1020102022096 is 6902202010201.
It is a self number, because there is not a number n which added to its sum of digits gives 1020102022096.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020102022091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 403520106 + ... + 403522633.
It is an arithmetic number, because the mean of its divisors is an integer number (100073299760).
Almost surely, 21020102022096 is an apocalyptic number.
1020102022096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1020102022096 is a deficient number, since it is larger than the sum of its proper divisors (981363973104).
1020102022096 is an equidigital number, since it uses as much as digits as its factorization.
1020102022096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 807042826 (or 807042820 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 1020102022096 its reverse (6902202010201), we get a palindrome (7922304032297).
The spelling of 1020102022096 in words is "one trillion, twenty billion, one hundred two million, twenty-two thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •