Base | Representation |
---|---|
bin | 111100110000000111… |
… | …0110010111010000111 |
3 | 110110202020010000000110 |
4 | 1321200032302322013 |
5 | 4114142124311101 |
6 | 135533433444103 |
7 | 12266002352622 |
oct | 1714016627207 |
9 | 413666100013 |
10 | 130463510151 |
11 | 50369283177 |
12 | 2134bb70633 |
13 | c3c1c219b0 |
14 | 6458c82db9 |
15 | 35d88becd6 |
hex | 1e603b2e87 |
130463510151 has 8 divisors (see below), whose sum is σ = 187332219760. Its totient is φ = 80285236992.
The previous prime is 130463510147. The next prime is 130463510161. The reversal of 130463510151 is 151015364031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130463510151 - 22 = 130463510147 is a prime.
It is a super-3 number, since 3×1304635101513 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130463510101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1672609066 + ... + 1672609143.
It is an arithmetic number, because the mean of its divisors is an integer number (23416527470).
Almost surely, 2130463510151 is an apocalyptic number.
130463510151 is a deficient number, since it is larger than the sum of its proper divisors (56868709609).
130463510151 is a wasteful number, since it uses less digits than its factorization.
130463510151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3345218225.
The product of its (nonzero) digits is 5400, while the sum is 30.
Adding to 130463510151 its reverse (151015364031), we get a palindrome (281478874182).
The spelling of 130463510151 in words is "one hundred thirty billion, four hundred sixty-three million, five hundred ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •