Base | Representation |
---|---|
bin | 1011111100010001111101… |
… | …1111010101011111000001 |
3 | 1201111020110020022022200211 |
4 | 2333010133133111133001 |
5 | 3210111214243111113 |
6 | 43531541151114121 |
7 | 2523425445556522 |
oct | 277043737253701 |
9 | 51436406268624 |
10 | 13130243332033 |
11 | 4202561068883 |
12 | 158088bb12941 |
13 | 74323b0a95a9 |
14 | 335715952849 |
15 | 17b833a63b3d |
hex | bf11f7d57c1 |
13130243332033 has 8 divisors (see below), whose sum is σ = 13702270013568. Its totient is φ = 12558312195264.
The previous prime is 13130243331871. The next prime is 13130243332039. The reversal of 13130243332033 is 33023334203131.
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 13130243332033 - 241 = 10931220076481 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13130243331986 and 13130243332004.
It is not an unprimeable number, because it can be changed into a prime (13130243332039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23605285 + ... + 24155122.
It is an arithmetic number, because the mean of its divisors is an integer number (1712783751696).
Almost surely, 213130243332033 is an apocalyptic number.
It is an amenable number.
13130243332033 is a deficient number, since it is larger than the sum of its proper divisors (572026681535).
13130243332033 is a wasteful number, since it uses less digits than its factorization.
13130243332033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47772383.
The product of its (nonzero) digits is 34992, while the sum is 31.
Adding to 13130243332033 its reverse (33023334203131), we get a palindrome (46153577535164).
The spelling of 13130243332033 in words is "thirteen trillion, one hundred thirty billion, two hundred forty-three million, three hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •