Base | Representation |
---|---|
bin | 111100100110001101… |
… | …0110000100101001110 |
3 | 110102220001121220210120 |
4 | 1321030122300211032 |
5 | 4113002030231110 |
6 | 135440441045410 |
7 | 12254525055006 |
oct | 1711432604516 |
9 | 412801556716 |
10 | 130131102030 |
11 | 50208684016 |
12 | 21278786866 |
13 | c36b0b7ab7 |
14 | 6426a75006 |
15 | 35b960d870 |
hex | 1e4c6b094e |
130131102030 has 32 divisors (see below), whose sum is σ = 328752259200. Its totient is φ = 32875225632.
The previous prime is 130131101999. The next prime is 130131102037. The reversal of 130131102030 is 30201131031.
130131102030 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 (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130131102037) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 114149520 + ... + 114150659.
It is an arithmetic number, because the mean of its divisors is an integer number (10273508100).
Almost surely, 2130131102030 is an apocalyptic number.
130131102030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130131102030 is an abundant number, since it is smaller than the sum of its proper divisors (198621157170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130131102030 is a wasteful number, since it uses less digits than its factorization.
130131102030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 228300208.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 130131102030 its reverse (30201131031), we get a palindrome (160332233061).
The spelling of 130131102030 in words is "one hundred thirty billion, one hundred thirty-one million, one hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •