Base | Representation |
---|---|
bin | 10111001100100101100001… |
… | …111111100000011111101011 |
3 | 111101020000110100212102210011 |
4 | 113030211201333200133223 |
5 | 101332443431032020021 |
6 | 1000551201512432351 |
7 | 30326462521541461 |
oct | 2714454177403753 |
9 | 441200410772704 |
10 | 102020002220011 |
11 | 2a5634926629a7 |
12 | b5381b03a86b7 |
13 | 44c05a2681555 |
14 | 1b29b19da4831 |
15 | bbdb93805de1 |
hex | 5cc961fe07eb |
102020002220011 has 8 divisors (see below), whose sum is σ = 102973717454400. Its totient is φ = 101066291750088.
The previous prime is 102020002219937. The next prime is 102020002220023. The reversal of 102020002220011 is 110022200020201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102020002220011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102020002219973 and 102020002220000.
It is not an unprimeable number, because it can be changed into a prime (102020000220011) 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, 53529340 + ... + 55402438.
It is an arithmetic number, because the mean of its divisors is an integer number (12871714681800).
Almost surely, 2102020002220011 is an apocalyptic number.
102020002220011 is a deficient number, since it is larger than the sum of its proper divisors (953715234389).
102020002220011 is a wasteful number, since it uses less digits than its factorization.
102020002220011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2382233.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 102020002220011 its reverse (110022200020201), we get a palindrome (212042202240212).
The spelling of 102020002220011 in words is "one hundred two trillion, twenty billion, two million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •