Base | Representation |
---|---|
bin | 11101100011111001010001… |
… | …011000011101000111100101 |
3 | 122001022211121012121010220201 |
4 | 131203321101120131013211 |
5 | 114020041013001241031 |
6 | 1140301440421230501 |
7 | 36245625425265154 |
oct | 3543712130350745 |
9 | 561284535533821 |
10 | 130010025415141 |
11 | 38474a3aaa0a93 |
12 | 126b8992562431 |
13 | 5770b7b6007b1 |
14 | 241673985959b |
15 | 1006cd47c6d61 |
hex | 763e5161d1e5 |
130010025415141 has 8 divisors (see below), whose sum is σ = 132316635584160. Its totient is φ = 127706850260112.
The previous prime is 130010025415139. The next prime is 130010025415217. The reversal of 130010025415141 is 141514520010031.
It is a happy number.
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 130010025415141 - 21 = 130010025415139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130010025415441) 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, 858677130 + ... + 858828523.
It is an arithmetic number, because the mean of its divisors is an integer number (16539579448020).
Almost surely, 2130010025415141 is an apocalyptic number.
It is an amenable number.
130010025415141 is a deficient number, since it is larger than the sum of its proper divisors (2306610169019).
130010025415141 is a wasteful number, since it uses less digits than its factorization.
130010025415141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1717506995.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 130010025415141 its reverse (141514520010031), we get a palindrome (271524545425172).
The spelling of 130010025415141 in words is "one hundred thirty trillion, ten billion, twenty-five million, four hundred fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •