Base | Representation |
---|---|
bin | 1011101100110111101… |
… | …0000000111100010111 |
3 | 201012212122022011002122 |
4 | 2323031322000330113 |
5 | 11243143344024421 |
6 | 232203153130155 |
7 | 20344352405555 |
oct | 2731572007427 |
9 | 635778264078 |
10 | 201023033111 |
11 | 7828729710a |
12 | 32b6225995b |
13 | 15c58262204 |
14 | 9a2dd06bd5 |
15 | 53681a52ab |
hex | 2ecde80f17 |
201023033111 has 8 divisors (see below), whose sum is σ = 201629528400. Its totient is φ = 200417405760.
The previous prime is 201023033063. The next prime is 201023033119. The reversal of 201023033111 is 111330320102.
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 201023033111 - 26 = 201023033047 is a prime.
It is a super-2 number, since 2×2010230331112 (a number of 23 digits) contains 22 as substring.
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 201023033111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201023033119) 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, 248435 + ... + 681003.
It is an arithmetic number, because the mean of its divisors is an integer number (25203691050).
Almost surely, 2201023033111 is an apocalyptic number.
201023033111 is a deficient number, since it is larger than the sum of its proper divisors (606495289).
201023033111 is an equidigital number, since it uses as much as digits as its factorization.
201023033111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433969.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 201023033111 its reverse (111330320102), we get a palindrome (312353353213).
The spelling of 201023033111 in words is "two hundred one billion, twenty-three million, thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •