Base | Representation |
---|---|
bin | 111100111011001000… |
… | …1101010101101001101 |
3 | 110111201000001102000111 |
4 | 1321312101222231031 |
5 | 4120421320033431 |
6 | 140034245000021 |
7 | 12311113140265 |
oct | 1716621525515 |
9 | 414630042014 |
10 | 130833361741 |
11 | 50539027145 |
12 | 214339b3011 |
13 | c4507388a4 |
14 | 649203a7a5 |
15 | 360b0ca7b1 |
hex | 1e7646ab4d |
130833361741 has 4 divisors (see below), whose sum is σ = 130853016000. Its totient is φ = 130813707484.
The previous prime is 130833361693. The next prime is 130833361753. The reversal of 130833361741 is 147163338031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 130833361741 - 211 = 130833359693 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130833361694 and 130833361703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130833364741) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9817141 + ... + 9830458.
It is an arithmetic number, because the mean of its divisors is an integer number (32713254000).
Almost surely, 2130833361741 is an apocalyptic number.
It is an amenable number.
130833361741 is a deficient number, since it is larger than the sum of its proper divisors (19654259).
130833361741 is an equidigital number, since it uses as much as digits as its factorization.
130833361741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19654258.
The product of its (nonzero) digits is 108864, while the sum is 40.
Adding to 130833361741 its reverse (147163338031), we get a palindrome (277996699772).
The spelling of 130833361741 in words is "one hundred thirty billion, eight hundred thirty-three million, three hundred sixty-one thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •