Base | Representation |
---|---|
bin | 1111100001011… |
… | …01110100011101 |
3 | 100002000102001101 |
4 | 13300231310131 |
5 | 231313223401 |
6 | 20530513101 |
7 | 3140530126 |
oct | 760556435 |
9 | 302012041 |
10 | 130211101 |
11 | 67556589 |
12 | 37735791 |
13 | 20c908b7 |
14 | 1341704d |
15 | b671101 |
hex | 7c2dd1d |
130211101 has 2 divisors, whose sum is σ = 130211102. Its totient is φ = 130211100.
The previous prime is 130211093. The next prime is 130211111. The reversal of 130211101 is 101112031.
It is an a-pointer prime, because the next prime (130211111) can be obtained adding 130211101 to its sum of digits (10).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112996900 + 17214201 = 10630^2 + 4149^2 .
It is a cyclic number.
It is not a de Polignac number, because 130211101 - 23 = 130211093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130211111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65105550 + 65105551.
It is an arithmetic number, because the mean of its divisors is an integer number (65105551).
Almost surely, 2130211101 is an apocalyptic number.
It is an amenable number.
130211101 is a deficient number, since it is larger than the sum of its proper divisors (1).
130211101 is an equidigital number, since it uses as much as digits as its factorization.
130211101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 10.
The square root of 130211101 is about 11411.0078871237. The cubic root of 130211101 is about 506.8537574207.
Adding to 130211101 its reverse (101112031), we get a palindrome (231323132).
It can be divided in two parts, 1302 and 11101, that added together give a triangular number (12403 = T157).
The spelling of 130211101 in words is "one hundred thirty million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •