Base | Representation |
---|---|
bin | 101101101110011011000111… |
… | …001110111011100001001101 |
3 | 222101001012012011000122101201 |
4 | 231232123013032323201031 |
5 | 202324330003114004401 |
6 | 1551413042152105501 |
7 | 60234106333012636 |
oct | 5556330716734115 |
9 | 871035164018351 |
10 | 201102301313101 |
11 | 590940094019a1 |
12 | 1a67ab81995291 |
13 | 8829b33a7bb86 |
14 | 37935909bc88d |
15 | 183b1ebac0b01 |
hex | b6e6c73bb84d |
201102301313101 has 8 divisors (see below), whose sum is σ = 201185495676000. Its totient is φ = 201019120433040.
The previous prime is 201102301313093. The next prime is 201102301313141. The reversal of 201102301313101 is 101313103201102.
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 201102301313101 - 23 = 201102301313093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201102301313141) 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, 26521111 + ... + 33250171.
It is an arithmetic number, because the mean of its divisors is an integer number (25148186959500).
Almost surely, 2201102301313101 is an apocalyptic number.
It is an amenable number.
201102301313101 is a deficient number, since it is larger than the sum of its proper divisors (83194362899).
201102301313101 is an equidigital number, since it uses as much as digits as its factorization.
201102301313101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6741419.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 201102301313101 its reverse (101313103201102), we get a palindrome (302415404514203).
The spelling of 201102301313101 in words is "two hundred one trillion, one hundred two billion, three hundred one million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •