Base | Representation |
---|---|
bin | 11101101111110011111… |
… | …11001010010000010101 |
3 | 10121201012222222110201102 |
4 | 32313321333022100111 |
5 | 113221230420124023 |
6 | 2101314042435445 |
7 | 133562423661155 |
oct | 16677177122025 |
9 | 3551188873642 |
10 | 1022101333013 |
11 | 36451a613572 |
12 | 14610b802b85 |
13 | 754cb109c97 |
14 | 37681844765 |
15 | 1b8c1c0e628 |
hex | edf9fca415 |
1022101333013 has 8 divisors (see below), whose sum is σ = 1039620674400. Its totient is φ = 1004588511408.
The previous prime is 1022101333009. The next prime is 1022101333067. The reversal of 1022101333013 is 3103331012201.
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 1022101333013 - 22 = 1022101333009 is a prime.
It is a super-2 number, since 2×10221013330132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022101333213) 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, 1313198 + ... + 1941311.
It is an arithmetic number, because the mean of its divisors is an integer number (129952584300).
Almost surely, 21022101333013 is an apocalyptic number.
It is an amenable number.
1022101333013 is a deficient number, since it is larger than the sum of its proper divisors (17519341387).
1022101333013 is an equidigital number, since it uses as much as digits as its factorization.
1022101333013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3259891.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1022101333013 its reverse (3103331012201), we get a palindrome (4125432345214).
The spelling of 1022101333013 in words is "one trillion, twenty-two billion, one hundred one million, three hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •