Base | Representation |
---|---|
bin | 111100110001011010… |
… | …0010111011010101101 |
3 | 110110212020210010011011 |
4 | 1321202310113122231 |
5 | 4114234232212303 |
6 | 135542024025221 |
7 | 12300040314100 |
oct | 1714264273255 |
9 | 413766703134 |
10 | 130506913453 |
11 | 50390828774 |
12 | 21362602211 |
13 | c3cac0a617 |
14 | 6460940737 |
15 | 35dc5e516d |
hex | 1e62d176ad |
130506913453 has 12 divisors (see below), whose sum is σ = 152013701052. Its totient is φ = 111716041920.
The previous prime is 130506913391. The next prime is 130506913483. The reversal of 130506913453 is 354319605031.
It can be written as a sum of positive squares in 2 ways, for example, as 11577114409 + 118929799044 = 107597^2 + 344862^2 .
It is not a de Polignac number, because 130506913453 - 217 = 130506782381 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 (130506913483) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1712650 + ... + 1787227.
It is an arithmetic number, because the mean of its divisors is an integer number (12667808421).
Almost surely, 2130506913453 is an apocalyptic number.
It is an amenable number.
130506913453 is a deficient number, since it is larger than the sum of its proper divisors (21506787599).
130506913453 is an equidigital number, since it uses as much as digits as its factorization.
130506913453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3500652 (or 3500645 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 40.
The spelling of 130506913453 in words is "one hundred thirty billion, five hundred six million, nine hundred thirteen thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •