Base | Representation |
---|---|
bin | 1001001001111000111011… |
… | …11001100101001101001111 |
3 | 2122021111122221012021110022 |
4 | 10210330131321211031033 |
5 | 10114311303404201343 |
6 | 110452020532532355 |
7 | 4145263164102026 |
oct | 444743571451517 |
9 | 78244587167408 |
10 | 20131013350223 |
11 | 6461573249196 |
12 | 23116377810bb |
13 | b304670bb189 |
14 | 4d84bc14b8bd |
15 | 24d9c1b66568 |
hex | 124f1de6534f |
20131013350223 has 8 divisors (see below), whose sum is σ = 20142213656400. Its totient is φ = 20119813755328.
The previous prime is 20131013350219. The next prime is 20131013350363. The reversal of 20131013350223 is 32205331013102.
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 20131013350223 - 22 = 20131013350219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20131013350192 and 20131013350201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20131013350823) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62564888 + ... + 62885826.
It is an arithmetic number, because the mean of its divisors is an integer number (2517776707050).
Almost surely, 220131013350223 is an apocalyptic number.
20131013350223 is a deficient number, since it is larger than the sum of its proper divisors (11200306177).
20131013350223 is a wasteful number, since it uses less digits than its factorization.
20131013350223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 355641.
The product of its (nonzero) digits is 3240, while the sum is 26.
Adding to 20131013350223 its reverse (32205331013102), we get a palindrome (52336344363325).
The spelling of 20131013350223 in words is "twenty trillion, one hundred thirty-one billion, thirteen million, three hundred fifty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •