Base | Representation |
---|---|
bin | 10110111111001110100100… |
… | …110011101101110110001101 |
3 | 111020222020221020010001002201 |
4 | 112333032210303231312031 |
5 | 101222423344022413401 |
6 | 555005341231321501 |
7 | 30203243546250004 |
oct | 2677164463556615 |
9 | 436866836101081 |
10 | 101102000201101 |
11 | 2a23a132431929 |
12 | b40a2b3380291 |
13 | 4454b54438c63 |
14 | 1ad7511bc7c3b |
15 | ba4d65b72b01 |
hex | 5bf3a4cedd8d |
101102000201101 has 8 divisors (see below), whose sum is σ = 101147479691544. Its totient is φ = 101056523991360.
The previous prime is 101102000201051. The next prime is 101102000201119.
101102000201101 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 25446970161001 + 75655030040100 = 5044499^2 + 8697990^2 .
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 101102000201101 - 27 = 101102000200973 is a prime.
It is a super-2 number, since 2×1011020002011012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101102000201401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61905231 + ... + 63517411.
It is an arithmetic number, because the mean of its divisors is an integer number (12643434961443).
Almost surely, 2101102000201101 is an apocalyptic number.
It is an amenable number.
101102000201101 is a deficient number, since it is larger than the sum of its proper divisors (45479490443).
101102000201101 is a wasteful number, since it uses less digits than its factorization.
101102000201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1640351.
The product of its (nonzero) digits is 4, while the sum is 10.
It can be divided in two parts, 101102000 and 201101, that added together give a palindrome (101303101).
The spelling of 101102000201101 in words is "one hundred one trillion, one hundred two billion, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •