Base | Representation |
---|---|
bin | 1011111100010100110100… |
… | …1100010111001000111010 |
3 | 1201111022102200010200100011 |
4 | 2333011031030113020322 |
5 | 3210114302042010020 |
6 | 43532145221532134 |
7 | 2523453446225032 |
oct | 277051514271072 |
9 | 51438380120304 |
10 | 13131010110010 |
11 | 4202914978491 |
12 | 1580a6487404a |
13 | 743330bc9a80 |
14 | 3357897108c2 |
15 | 17b87b02735a |
hex | bf14d31723a |
13131010110010 has 64 divisors (see below), whose sum is σ = 26436134592000. Its totient is φ = 4664788572672.
The previous prime is 13131010109999. The next prime is 13131010110011. The reversal of 13131010110010 is 1001101013131.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is not an unprimeable number, because it can be changed into a prime (13131010110011) 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 31 ways as a sum of consecutive naturals, for example, 17852235 + ... + 18573214.
It is an arithmetic number, because the mean of its divisors is an integer number (413064603000).
Almost surely, 213131010110010 is an apocalyptic number.
13131010110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13131010110010 is an abundant number, since it is smaller than the sum of its proper divisors (13305124481990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13131010110010 is a wasteful number, since it uses less digits than its factorization.
13131010110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36425575.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 13131010110010 its reverse (1001101013131), we get a palindrome (14132111123141).
The spelling of 13131010110010 in words is "thirteen trillion, one hundred thirty-one billion, ten million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •