Base | Representation |
---|---|
bin | 101101101110011010001011… |
… | …100111000101101010001010 |
3 | 222101001002121102210010210122 |
4 | 231232122023213011222022 |
5 | 202324320431024410010 |
6 | 1551412355020143242 |
7 | 60234042465422330 |
oct | 5556321347055212 |
9 | 871032542703718 |
10 | 201101301013130 |
11 | 590936457a3801 |
12 | 1a67a942997b22 |
13 | 8829a047682bb |
14 | 37934d7bd3b50 |
15 | 183b18dd80855 |
hex | b6e68b9c5a8a |
201101301013130 has 64 divisors (see below), whose sum is σ = 438097543011072. Its totient is φ = 64883046159360.
The previous prime is 201101301013117. The next prime is 201101301013153. The reversal of 201101301013130 is 31310103101102.
201101301013130 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 201101301013099 and 201101301013108.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5596316 + ... + 20821175.
It is an arithmetic number, because the mean of its divisors is an integer number (6845274109548).
Almost surely, 2201101301013130 is an apocalyptic number.
201101301013130 is an abundant number, since it is smaller than the sum of its proper divisors (236996241997942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201101301013130 is a wasteful number, since it uses less digits than its factorization.
201101301013130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26423919.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 201101301013130 its reverse (31310103101102), we get a palindrome (232411404114232).
The spelling of 201101301013130 in words is "two hundred one trillion, one hundred one billion, three hundred one million, thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •