Base | Representation |
---|---|
bin | 11101101000010010100111… |
… | …101000010011001100100101 |
3 | 122002101201100201002012200000 |
4 | 131220102213220103030211 |
5 | 114040013210222320401 |
6 | 1141052321143211513 |
7 | 36306511550022213 |
oct | 3550224750231445 |
9 | 562351321065600 |
10 | 130312120120101 |
11 | 3858107263a107 |
12 | 12747441446b99 |
13 | 57934c33b509a |
14 | 24271d6c69cb3 |
15 | 100eab5d04186 |
hex | 7684a7a13325 |
130312120120101 has 12 divisors (see below), whose sum is σ = 195200048246112. Its totient is φ = 86874746746572.
The previous prime is 130312120120099. The next prime is 130312120120123. The reversal of 130312120120101 is 101021021213031.
130312120120101 is a `hidden beast` number, since 1 + 30 + 312 + 1 + 201 + 20 + 101 = 666.
It is not a de Polignac number, because 130312120120101 - 21 = 130312120120099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130312120120141) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 268131934161 + ... + 268131934646.
It is an arithmetic number, because the mean of its divisors is an integer number (16266670687176).
Almost surely, 2130312120120101 is an apocalyptic number.
It is an amenable number.
130312120120101 is a deficient number, since it is larger than the sum of its proper divisors (64887928126011).
130312120120101 is an frugal number, since it uses more digits than its factorization.
130312120120101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 536263868822 (or 536263868810 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 130312120120101 its reverse (101021021213031), we get a palindrome (231333141333132).
The spelling of 130312120120101 in words is "one hundred thirty trillion, three hundred twelve billion, one hundred twenty million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •