Base | Representation |
---|---|
bin | 1011111100010101001101… |
… | …0001110110011000101010 |
3 | 1201111022200210020222221201 |
4 | 2333011103101312120222 |
5 | 3210120004211241020 |
6 | 43532203310154414 |
7 | 2523456126123352 |
oct | 277052321663052 |
9 | 51438623228851 |
10 | 13131112212010 |
11 | 4202967575201 |
12 | 1580a92ab2a0a |
13 | 7433490c8260 |
14 | 3357990cbb62 |
15 | 17b884e94a0a |
hex | bf15347662a |
13131112212010 has 16 divisors (see below), whose sum is σ = 25454155980456. Its totient is φ = 4848410662848.
The previous prime is 13131112211989. The next prime is 13131112212019. The reversal of 13131112212010 is 1021221113131.
It can be written as a sum of positive squares in 4 ways, for example, as 6389211680721 + 6741900531289 = 2527689^2 + 2596517^2 .
It is a super-2 number, since 2×131311122120102 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13131112212019) 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, 50504277609 + ... + 50504277868.
Almost surely, 213131112212010 is an apocalyptic number.
13131112212010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13131112212010 is a deficient number, since it is larger than the sum of its proper divisors (12323043768446).
13131112212010 is a wasteful number, since it uses less digits than its factorization.
13131112212010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101008555497.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 13131112212010 its reverse (1021221113131), we get a palindrome (14152333325141).
The spelling of 13131112212010 in words is "thirteen trillion, one hundred thirty-one billion, one hundred twelve million, two hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •