Base | Representation |
---|---|
bin | 1011110010000000001… |
… | …0111011100100011111 |
3 | 201100102200101022101020 |
4 | 2330200002323210133 |
5 | 11304004140231421 |
6 | 232552022015223 |
7 | 20423454660465 |
oct | 2744002734437 |
9 | 640380338336 |
10 | 202401102111 |
11 | 7892416680a |
12 | 33287877513 |
13 | 16117902660 |
14 | 9b20d4a835 |
15 | 53e9166dc6 |
hex | 2f200bb91f |
202401102111 has 32 divisors (see below), whose sum is σ = 310072105728. Its totient is φ = 116332869120.
The previous prime is 202401102089. The next prime is 202401102119. The reversal of 202401102111 is 111201104202.
202401102111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 202401102111 - 27 = 202401101983 is a prime.
It is a super-2 number, since 2×2024011021112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202401102119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1078341 + ... + 1252046.
It is an arithmetic number, because the mean of its divisors is an integer number (9689753304).
Almost surely, 2202401102111 is an apocalyptic number.
202401102111 is a deficient number, since it is larger than the sum of its proper divisors (107671003617).
202401102111 is a wasteful number, since it uses less digits than its factorization.
202401102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2330551.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 202401102111 its reverse (111201104202), we get a palindrome (313602206313).
The spelling of 202401102111 in words is "two hundred two billion, four hundred one million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •