Base | Representation |
---|---|
bin | 1001001001111000111011… |
… | …11100100011100111000001 |
3 | 2122021111122222122220021010 |
4 | 10210330131330203213001 |
5 | 10114311304104130423 |
6 | 110452021001351133 |
7 | 4145263203530535 |
oct | 444743574434701 |
9 | 78244588586233 |
10 | 20131014130113 |
11 | 6461573731127 |
12 | 2311637a984a9 |
13 | b30467302153 |
14 | 4d84bc2b1bc5 |
15 | 24d9c1c6c693 |
hex | 124f1df239c1 |
20131014130113 has 16 divisors (see below), whose sum is σ = 26882666641152. Its totient is φ = 13400029344000.
The previous prime is 20131014130069. The next prime is 20131014130133. The reversal of 20131014130113 is 31103141013102.
It is not a de Polignac number, because 20131014130113 - 26 = 20131014130049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20131014130113.
It is not an unprimeable number, because it can be changed into a prime (20131014130133) 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 15 ways as a sum of consecutive naturals, for example, 6377608 + ... + 8996438.
It is an arithmetic number, because the mean of its divisors is an integer number (1680166665072).
Almost surely, 220131014130113 is an apocalyptic number.
It is an amenable number.
20131014130113 is a deficient number, since it is larger than the sum of its proper divisors (6751652511039).
20131014130113 is a wasteful number, since it uses less digits than its factorization.
20131014130113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2622776.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 20131014130113 its reverse (31103141013102), we get a palindrome (51234155143215).
The spelling of 20131014130113 in words is "twenty trillion, one hundred thirty-one billion, fourteen million, one hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •