Base | Representation |
---|---|
bin | 101101110001011111011100… |
… | …011010101000111111110000 |
3 | 222101210100022202221200210220 |
4 | 231301133130122220333300 |
5 | 202341303222141231000 |
6 | 1552053544400053040 |
7 | 60255251352112011 |
oct | 5561373432507760 |
9 | 871710282850726 |
10 | 201313110102000 |
11 | 59165457481186 |
12 | 1a6b39b5304180 |
13 | 884398b4c7910 |
14 | 379d86c3d9008 |
15 | 1841938e141a0 |
hex | b717dc6a8ff0 |
201313110102000 has 160 divisors (see below), whose sum is σ = 698959118544960. Its totient is φ = 49553996313600.
The previous prime is 201313110101927. The next prime is 201313110102023. The reversal of 201313110102000 is 201011313102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
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, 1290390655 + ... + 1290546654.
It is an arithmetic number, because the mean of its divisors is an integer number (4368494490906).
Almost surely, 2201313110102000 is an apocalyptic number.
201313110102000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201313110102000 is an abundant number, since it is smaller than the sum of its proper divisors (497646008442960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201313110102000 is a wasteful number, since it uses less digits than its factorization.
201313110102000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2580937348 (or 2580937332 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 201313110102000 its reverse (201011313102), we get a palindrome (201514121415102).
The spelling of 201313110102000 in words is "two hundred one trillion, three hundred thirteen billion, one hundred ten million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •