Base | Representation |
---|---|
bin | 1011101101001001111… |
… | …1101010010000001001 |
3 | 201020002000011000020020 |
4 | 2323102133222100021 |
5 | 11243323100314010 |
6 | 232214543051053 |
7 | 20346305612502 |
oct | 2732237522011 |
9 | 636060130206 |
10 | 201100010505 |
11 | 78316793399 |
12 | 32b83ba0a89 |
13 | 15c6b1a4874 |
14 | 9a3a223ba9 |
15 | 536ed0d470 |
hex | 2ed27ea409 |
201100010505 has 32 divisors (see below), whose sum is σ = 329660610048. Its totient is φ = 104620646400.
The previous prime is 201100010479. The next prime is 201100010549. The reversal of 201100010505 is 505010001102.
201100010505 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 201100010505 - 212 = 201100006409 is a prime.
It is a super-2 number, since 2×2011000105052 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
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, 4434345 + ... + 4479465.
It is an arithmetic number, because the mean of its divisors is an integer number (10301894064).
Almost surely, 2201100010505 is an apocalyptic number.
It is an amenable number.
201100010505 is a deficient number, since it is larger than the sum of its proper divisors (128560599543).
201100010505 is a wasteful number, since it uses less digits than its factorization.
201100010505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52417.
The product of its (nonzero) digits is 50, while the sum is 15.
Adding to 201100010505 its reverse (505010001102), we get a palindrome (706110011607).
The spelling of 201100010505 in words is "two hundred one billion, one hundred million, ten thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •