Base | Representation |
---|---|
bin | 10111111110010… |
… | …00111011001010 |
3 | 112000101222201021 |
4 | 23333020323022 |
5 | 402440213002 |
6 | 31542143054 |
7 | 4661221204 |
oct | 1377107312 |
9 | 460358637 |
10 | 201101002 |
11 | a3575183 |
12 | 57421a8a |
13 | 3288149b |
14 | 1c9cb774 |
15 | 129c5737 |
hex | bfc8eca |
201101002 has 4 divisors (see below), whose sum is σ = 301651506. Its totient is φ = 100550500.
The previous prime is 201100961. The next prime is 201101003. The reversal of 201101002 is 200101102.
201101002 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 197711721 + 3389281 = 14061^2 + 1841^2 .
It is a super-2 number, since 2×2011010022 = 80883226010808008, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201101003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50275249 + ... + 50275252.
Almost surely, 2201101002 is an apocalyptic number.
201101002 is a deficient number, since it is larger than the sum of its proper divisors (100550504).
201101002 is a wasteful number, since it uses less digits than its factorization.
201101002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100550503.
The product of its (nonzero) digits is 4, while the sum is 7.
The square root of 201101002 is about 14181.0084972826. The cubic root of 201101002 is about 585.8747009299.
Adding to 201101002 its reverse (200101102), we get a palindrome (401202104).
It can be divided in two parts, 20110 and 1002, that added together give a palindrome (21112).
The spelling of 201101002 in words is "two hundred one million, one hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •