Base | Representation |
---|---|
bin | 1011111100010001111001… |
… | …0010101100111111000101 |
3 | 1201111020101211111201000011 |
4 | 2333010132102230333011 |
5 | 3210111144122240310 |
6 | 43531535152350221 |
7 | 2523425113040515 |
oct | 277043622547705 |
9 | 51436354451004 |
10 | 13130223243205 |
11 | 4202550797842 |
12 | 1580885245371 |
13 | 743236b94903 |
14 | 335713003845 |
15 | 17b831de678a |
hex | bf11e4acfc5 |
13130223243205 has 8 divisors (see below), whose sum is σ = 16182112970232. Its totient is φ = 10220281875648.
The previous prime is 13130223243157. The next prime is 13130223243223. The reversal of 13130223243205 is 50234232203131.
It can be written as a sum of positive squares in 4 ways, for example, as 3016970985249 + 10113252257956 = 1736943^2 + 3180134^2 .
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 13130223243205 - 29 = 13130223242693 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35487089662 + ... + 35487090031.
It is an arithmetic number, because the mean of its divisors is an integer number (2022764121279).
Almost surely, 213130223243205 is an apocalyptic number.
It is an amenable number.
13130223243205 is a deficient number, since it is larger than the sum of its proper divisors (3051889727027).
13130223243205 is an equidigital number, since it uses as much as digits as its factorization.
13130223243205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70974179735.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 13130223243205 its reverse (50234232203131), we get a palindrome (63364455446336).
The spelling of 13130223243205 in words is "thirteen trillion, one hundred thirty billion, two hundred twenty-three million, two hundred forty-three thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •