Base | Representation |
---|---|
bin | 11101101111110011111… |
… | …10010001111000010101 |
3 | 10121201012222112201222010 |
4 | 32313321332101320111 |
5 | 113221230340231401 |
6 | 2101314033454433 |
7 | 133562422010022 |
oct | 16677176217025 |
9 | 3551188481863 |
10 | 1022101102101 |
11 | 36451a476032 |
12 | 14610b711419 |
13 | 754cb058b51 |
14 | 376817c4549 |
15 | 1b8c1bb5ed6 |
hex | edf9f91e15 |
1022101102101 has 8 divisors (see below), whose sum is σ = 1362834201600. Its totient is φ = 681384368672.
The previous prime is 1022101102069. The next prime is 1022101102103. The reversal of 1022101102101 is 1012011012201.
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 1022101102101 - 25 = 1022101102069 is a prime.
It is a super-3 number, since 3×10221011021013 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022101102103) 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, 3945045 + ... + 4196138.
It is an arithmetic number, because the mean of its divisors is an integer number (170354275200).
Almost surely, 21022101102101 is an apocalyptic number.
It is an amenable number.
1022101102101 is a deficient number, since it is larger than the sum of its proper divisors (340733099499).
1022101102101 is an equidigital number, since it uses as much as digits as its factorization.
1022101102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8183035.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1022101102101 its reverse (1012011012201), we get a palindrome (2034112114302).
The spelling of 1022101102101 in words is "one trillion, twenty-two billion, one hundred one million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •