Base | Representation |
---|---|
bin | 111100101000010010… |
… | …1011100001101000010 |
3 | 110110001221011122220001 |
4 | 1321100211130031002 |
5 | 4113122424323020 |
6 | 135451415310214 |
7 | 12256334222200 |
oct | 1712045341502 |
9 | 413057148801 |
10 | 130201011010 |
11 | 50244092734 |
12 | 2129807b36a |
13 | c37c724065 |
14 | 6432072070 |
15 | 35c081c50a |
hex | 1e5095c342 |
130201011010 has 48 divisors (see below), whose sum is σ = 286973677440. Its totient is φ = 42290851680.
The previous prime is 130201010969. The next prime is 130201011013. The reversal of 130201011010 is 10110102031.
It is a super-3 number, since 3×1302010110103 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (130201011013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6983226 + ... + 7001845.
It is an arithmetic number, because the mean of its divisors is an integer number (5978618280).
Almost surely, 2130201011010 is an apocalyptic number.
130201011010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130201011010 is an abundant number, since it is smaller than the sum of its proper divisors (156772666430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130201011010 is a wasteful number, since it uses less digits than its factorization.
130201011010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13985111 (or 13985104 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 130201011010 its reverse (10110102031), we get a palindrome (140311113041).
The spelling of 130201011010 in words is "one hundred thirty billion, two hundred one million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •