Base | Representation |
---|---|
bin | 1011111100010001011011… |
… | …1110000110001101110011 |
3 | 1201111020002021100200012021 |
4 | 2333010112332012031303 |
5 | 3210110421200313021 |
6 | 43531515043412311 |
7 | 2523422061641146 |
oct | 277042676061563 |
9 | 51436067320167 |
10 | 13130100401011 |
11 | 4202498414670 |
12 | 1580850084097 |
13 | 7432175b4119 |
14 | 33570098805d |
15 | 17b82622dc41 |
hex | bf116f86373 |
13130100401011 has 4 divisors (see below), whose sum is σ = 14323745892024. Its totient is φ = 11936454910000.
The previous prime is 13130100400931. The next prime is 13130100401039. The reversal of 13130100401011 is 11010400103131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13130100401011 - 215 = 13130100368243 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13130100401051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 596822745490 + ... + 596822745511.
It is an arithmetic number, because the mean of its divisors is an integer number (3580936473006).
Almost surely, 213130100401011 is an apocalyptic number.
13130100401011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13130100401011 is a deficient number, since it is larger than the sum of its proper divisors (1193645491013).
13130100401011 is a wasteful number, since it uses less digits than its factorization.
13130100401011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1193645491012.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 13130100401011 its reverse (11010400103131), we get a palindrome (24140500504142).
The spelling of 13130100401011 in words is "thirteen trillion, one hundred thirty billion, one hundred million, four hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •