Base | Representation |
---|---|
bin | 111100100101010100… |
… | …0010110100110100000 |
3 | 110102210222012020010002 |
4 | 1321022220112212200 |
5 | 4112421341024300 |
6 | 135433450155132 |
7 | 12254012125124 |
oct | 1711250264640 |
9 | 412728166102 |
10 | 130101111200 |
11 | 501a275a505 |
12 | 2126a722aa8 |
13 | c364b17048 |
14 | 6422aa9584 |
15 | 35b6b875d5 |
hex | 1e4aa169a0 |
130101111200 has 72 divisors (see below), whose sum is σ = 318611880972. Its totient is φ = 51876177920.
The previous prime is 130101111187. The next prime is 130101111227. The reversal of 130101111200 is 2111101031.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 58686031504 + 71415079696 = 242252^2 + 267236^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2909 + ... + 510108.
Almost surely, 2130101111200 is an apocalyptic number.
130101111200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 130101111200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159305940486).
130101111200 is an abundant number, since it is smaller than the sum of its proper divisors (188510769772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130101111200 is a wasteful number, since it uses less digits than its factorization.
130101111200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 513354 (or 513341 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 130101111200 its reverse (2111101031), we get a palindrome (132212212231).
The spelling of 130101111200 in words is "one hundred thirty billion, one hundred one million, one hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •