Base | Representation |
---|---|
bin | 111100100011000011… |
… | …0011011101111101111 |
3 | 110102121200011222202202 |
4 | 1321012012123233233 |
5 | 4112242412014021 |
6 | 135422133212115 |
7 | 12252100126562 |
oct | 1710606335757 |
9 | 412550158682 |
10 | 130025110511 |
11 | 5016387001a |
12 | 2124919103b |
13 | c35215711a |
14 | 64169644d9 |
15 | 35b0173a0b |
hex | 1e4619bbef |
130025110511 has 8 divisors (see below), whose sum is σ = 139780634880. Its totient is φ = 120560795928.
The previous prime is 130025110507. The next prime is 130025110513. The reversal of 130025110511 is 115011520031.
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 130025110511 - 22 = 130025110507 is a prime.
It is a super-2 number, since 2×1300251105112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130025110513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 72801521 + ... + 72803306.
It is an arithmetic number, because the mean of its divisors is an integer number (17472579360).
Almost surely, 2130025110511 is an apocalyptic number.
130025110511 is a deficient number, since it is larger than the sum of its proper divisors (9755524369).
130025110511 is a wasteful number, since it uses less digits than its factorization.
130025110511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145604893.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 130025110511 its reverse (115011520031), we get a palindrome (245036630542).
The spelling of 130025110511 in words is "one hundred thirty billion, twenty-five million, one hundred ten thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •