Base | Representation |
---|---|
bin | 111100110001110110… |
… | …0100100000010101111 |
3 | 110110220021111120100120 |
4 | 1321203230210002233 |
5 | 4114302020121411 |
6 | 135543311500023 |
7 | 12300306451635 |
oct | 1714354440257 |
9 | 413807446316 |
10 | 130521645231 |
11 | 5039907a99a |
12 | 21367527613 |
13 | c400c97b53 |
14 | 6462897355 |
15 | 35dda55106 |
hex | 1e63b240af |
130521645231 has 8 divisors (see below), whose sum is σ = 174050968320. Its totient is φ = 87003376152.
The previous prime is 130521645211. The next prime is 130521645253. The reversal of 130521645231 is 132546125031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130521645231 - 227 = 130387427503 is a prime.
It is a super-2 number, since 2×1305216452312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130521645192 and 130521645201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130521645211) 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, 2735911 + ... + 2783208.
It is an arithmetic number, because the mean of its divisors is an integer number (21756371040).
Almost surely, 2130521645231 is an apocalyptic number.
130521645231 is a deficient number, since it is larger than the sum of its proper divisors (43529323089).
130521645231 is an equidigital number, since it uses as much as digits as its factorization.
130521645231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5527005.
The product of its (nonzero) digits is 21600, while the sum is 33.
The spelling of 130521645231 in words is "one hundred thirty billion, five hundred twenty-one million, six hundred forty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •