Base | Representation |
---|---|
bin | 11101110100000011001101… |
… | …000100000010111111100011 |
3 | 122012020222011022201002221210 |
4 | 131310003031010002333203 |
5 | 114141233133203034103 |
6 | 1142511442250321203 |
7 | 36422056560500265 |
oct | 3564031504027743 |
9 | 565228138632853 |
10 | 131120202002403 |
11 | 38862846808679 |
12 | 12857b82429203 |
13 | 5821774843923 |
14 | 24543746d1b35 |
15 | 1025b0d8b7e03 |
hex | 7740cd102fe3 |
131120202002403 has 16 divisors (see below), whose sum is σ = 174955008614400. Its totient is φ = 87349455147456.
The previous prime is 131120202002381. The next prime is 131120202002411. The reversal of 131120202002403 is 304200202021131.
It is not a de Polignac number, because 131120202002403 - 210 = 131120202001379 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131120202002403.
It is not an unprimeable number, because it can be changed into a prime (131120202004403) 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, 19456698 + ... + 25314096.
It is an arithmetic number, because the mean of its divisors is an integer number (10934688038400).
Almost surely, 2131120202002403 is an apocalyptic number.
131120202002403 is a deficient number, since it is larger than the sum of its proper divisors (43834806611997).
131120202002403 is a wasteful number, since it uses less digits than its factorization.
131120202002403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5862866.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 131120202002403 its reverse (304200202021131), we get a palindrome (435320404023534).
The spelling of 131120202002403 in words is "one hundred thirty-one trillion, one hundred twenty billion, two hundred two million, two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •