Base | Representation |
---|---|
bin | 111111011110110… |
… | …1100001101111001 |
3 | 12111110011100101211 |
4 | 1332331230031321 |
5 | 13330301213423 |
6 | 551211243121 |
7 | 103533363220 |
oct | 17675541571 |
9 | 5443140354 |
10 | 2130101113 |
11 | 9a3428548 |
12 | 4b54494a1 |
13 | 27c3c9b7a |
14 | 162c83cb7 |
15 | c701110d |
hex | 7ef6c379 |
2130101113 has 8 divisors (see below), whose sum is σ = 2434795328. Its totient is φ = 1825505424.
The previous prime is 2130101107. The next prime is 2130101119. The reversal of 2130101113 is 3111010312.
It is an interprime number because it is at equal distance from previous prime (2130101107) and next prime (2130101119).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2130101113 - 25 = 2130101081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2130101093 and 2130101102.
It is not an unprimeable number, because it can be changed into a prime (2130101119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29695 + ... + 71707.
It is an arithmetic number, because the mean of its divisors is an integer number (304349416).
Almost surely, 22130101113 is an apocalyptic number.
It is an amenable number.
2130101113 is a deficient number, since it is larger than the sum of its proper divisors (304694215).
2130101113 is an equidigital number, since it uses as much as digits as its factorization.
2130101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49263.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 2130101113 is about 46153.0184603347. The cubic root of 2130101113 is about 1286.6687103499.
Adding to 2130101113 its reverse (3111010312), we get a palindrome (5241111425).
The spelling of 2130101113 in words is "two billion, one hundred thirty million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •