Base | Representation |
---|---|
bin | 101101110000001000101111… |
… | …010001110000000011001011 |
3 | 222101110110000112120021222102 |
4 | 231300020233101300003023 |
5 | 202333242040304000021 |
6 | 1551543110311144015 |
7 | 60245444311600463 |
oct | 5560105721600313 |
9 | 871413015507872 |
10 | 201220011000011 |
11 | 59129a22461983 |
12 | 1a69995267500b |
13 | 8837c726032a3 |
14 | 3799159a98ba3 |
15 | 183e2da96a00b |
hex | b7022f4700cb |
201220011000011 has 8 divisors (see below), whose sum is σ = 203007015189504. Its totient is φ = 199433117269120.
The previous prime is 201220010999957. The next prime is 201220011000061. The reversal of 201220011000011 is 110000110022102.
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 201220011000011 - 234 = 201202831130827 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201220010999956 and 201220011000001.
It is not an unprimeable number, because it can be changed into a prime (201220011000061) 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, 23952971 + ... + 31243956.
It is an arithmetic number, because the mean of its divisors is an integer number (25375876898688).
Almost surely, 2201220011000011 is an apocalyptic number.
201220011000011 is a deficient number, since it is larger than the sum of its proper divisors (1787004189493).
201220011000011 is a wasteful number, since it uses less digits than its factorization.
201220011000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55229301.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 201220011000011 its reverse (110000110022102), we get a palindrome (311220121022113).
The spelling of 201220011000011 in words is "two hundred one trillion, two hundred twenty billion, eleven million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •