Base | Representation |
---|---|
bin | 111100110001110011… |
… | …1011100110111101010 |
3 | 110110220011222111002012 |
4 | 1321203213130313222 |
5 | 4114301144231010 |
6 | 135543223035522 |
7 | 12300262200635 |
oct | 1714347346752 |
9 | 413804874065 |
10 | 130520305130 |
11 | 50398345076 |
12 | 21366b9bba2 |
13 | c400918ba7 |
14 | 6462628c1c |
15 | 35dd88d005 |
hex | 1e639dcdea |
130520305130 has 8 divisors (see below), whose sum is σ = 234936549252. Its totient is φ = 52208122048.
The previous prime is 130520305129. The next prime is 130520305169. The reversal of 130520305130 is 31503025031.
It can be written as a sum of positive squares in 2 ways, for example, as 104996088961 + 25524216169 = 324031^2 + 159763^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 130520305096 and 130520305105.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 6526015247 + ... + 6526015266.
Almost surely, 2130520305130 is an apocalyptic number.
130520305130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130520305130 is a deficient number, since it is larger than the sum of its proper divisors (104416244122).
130520305130 is a wasteful number, since it uses less digits than its factorization.
130520305130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13052030520.
The product of its (nonzero) digits is 1350, while the sum is 23.
The spelling of 130520305130 in words is "one hundred thirty billion, five hundred twenty million, three hundred five thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •