Base | Representation |
---|---|
bin | 111100100110001101… |
… | …1001000100000000001 |
3 | 110102220001210220012010 |
4 | 1321030123020200001 |
5 | 4113002041400001 |
6 | 135440443123133 |
7 | 12254525643435 |
oct | 1711433104001 |
9 | 412801726163 |
10 | 130131200001 |
11 | 50208740690 |
12 | 212788134a9 |
13 | c36b12057a |
14 | 6426a9c9c5 |
15 | 35b962c8d6 |
hex | 1e4c6c8801 |
130131200001 has 8 divisors (see below), whose sum is σ = 189281745504. Its totient is φ = 78867393920.
The previous prime is 130131199997. The next prime is 130131200029. The reversal of 130131200001 is 100002131031.
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 130131200001 - 22 = 130131199997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130131200001.
It is not an unprimeable number, because it can be changed into a prime (130131200071) 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, 1971684816 + ... + 1971684881.
It is an arithmetic number, because the mean of its divisors is an integer number (23660218188).
Almost surely, 2130131200001 is an apocalyptic number.
130131200001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
130131200001 is a deficient number, since it is larger than the sum of its proper divisors (59150545503).
130131200001 is a wasteful number, since it uses less digits than its factorization.
130131200001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3943369711.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 130131200001 its reverse (100002131031), we get a palindrome (230133331032).
The spelling of 130131200001 in words is "one hundred thirty billion, one hundred thirty-one million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •