Base | Representation |
---|---|
bin | 11101100101001101010000… |
… | …110011110011010110100101 |
3 | 122001122110101100000211121111 |
4 | 131211031100303303112211 |
5 | 114023030212242320401 |
6 | 1140411113400345021 |
7 | 36255300326524144 |
oct | 3545152063632645 |
9 | 561573340024544 |
10 | 130100210120101 |
11 | 384aa2099a8701 |
12 | 12712361175171 |
13 | 5779521783340 |
14 | 241ac530b775b |
15 | 1009311e8ae51 |
hex | 765350cf35a5 |
130100210120101 has 16 divisors (see below), whose sum is σ = 147842259022080. Its totient is φ = 113580402122880.
The previous prime is 130100210120087. The next prime is 130100210120137. The reversal of 130100210120101 is 101021012001031.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 130100210120101 - 233 = 130091620185509 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130100210120191) 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, 2444455185 + ... + 2444508406.
It is an arithmetic number, because the mean of its divisors is an integer number (9240141188880).
Almost surely, 2130100210120101 is an apocalyptic number.
It is an amenable number.
130100210120101 is a deficient number, since it is larger than the sum of its proper divisors (17742048901979).
130100210120101 is a wasteful number, since it uses less digits than its factorization.
130100210120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4888963716.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 130100210120101 its reverse (101021012001031), we get a palindrome (231121222121132).
The spelling of 130100210120101 in words is "one hundred thirty trillion, one hundred billion, two hundred ten million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •