Base | Representation |
---|---|
bin | 1011111100010001110011… |
… | …1110010110100000100011 |
3 | 1201111020100021220021211012 |
4 | 2333010130332112200203 |
5 | 3210111122442143133 |
6 | 43531533042411135 |
7 | 2523424424063543 |
oct | 277043476264043 |
9 | 51436307807735 |
10 | 13130201131043 |
11 | 420253a264627 |
12 | 1580879960aab |
13 | 743232421ca9 |
14 | 3357100c9323 |
15 | 17b82eec9b48 |
hex | bf11cf96823 |
13130201131043 has 8 divisors (see below), whose sum is σ = 13636589091840. Its totient is φ = 12631787784000.
The previous prime is 13130201131031. The next prime is 13130201131129. The reversal of 13130201131043 is 34013110203131.
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 13130201131043 - 212 = 13130201126947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13130201191043) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1993650083 + ... + 1993656668.
It is an arithmetic number, because the mean of its divisors is an integer number (1704573636480).
Almost surely, 213130201131043 is an apocalyptic number.
13130201131043 is a deficient number, since it is larger than the sum of its proper divisors (506387960797).
13130201131043 is an equidigital number, since it uses as much as digits as its factorization.
13130201131043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3987306877.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13130201131043 its reverse (34013110203131), we get a palindrome (47143311334174).
The spelling of 13130201131043 in words is "thirteen trillion, one hundred thirty billion, two hundred one million, one hundred thirty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •