Base | Representation |
---|---|
bin | 11101101111110100000… |
… | …01110000010011001101 |
3 | 10121201020001021000200001 |
4 | 32313322001300103031 |
5 | 113221231103410013 |
6 | 2101314105204301 |
7 | 133562432523055 |
oct | 16677201602315 |
9 | 3551201230601 |
10 | 1022102013133 |
11 | 36451aa38553 |
12 | 14610ba90691 |
13 | 754cb2b7716 |
14 | 37681980565 |
15 | 1b8c1ce5ddd |
hex | edfa0704cd |
1022102013133 has 8 divisors (see below), whose sum is σ = 1024183460160. Its totient is φ = 1020021344160.
The previous prime is 1022102013091. The next prime is 1022102013139. The reversal of 1022102013133 is 3313102012201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1022102013133 - 233 = 1013512078541 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 1022102013133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022102013139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2472633 + ... + 2856241.
It is an arithmetic number, because the mean of its divisors is an integer number (128022932520).
Almost surely, 21022102013133 is an apocalyptic number.
It is an amenable number.
1022102013133 is a deficient number, since it is larger than the sum of its proper divisors (2081447027).
1022102013133 is an equidigital number, since it uses as much as digits as its factorization.
1022102013133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389027.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1022102013133 its reverse (3313102012201), we get a palindrome (4335204025334).
The spelling of 1022102013133 in words is "one trillion, twenty-two billion, one hundred two million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •