Base | Representation |
---|---|
bin | 11101110111000110101101… |
… | …010101001001000010011011 |
3 | 122020000001000002010012122112 |
4 | 131313012231111021002123 |
5 | 114203203042442311303 |
6 | 1143152120422142535 |
7 | 36443200606561265 |
oct | 3567065525110233 |
9 | 566001002105575 |
10 | 131330123010203 |
11 | 38933879740877 |
12 | 128907a8581a4b |
13 | 58384ba383800 |
14 | 24605aa252b35 |
15 | 102b2e7ce50d8 |
hex | 7771ad54909b |
131330123010203 has 6 divisors (see below), whose sum is σ = 142209541484604. Its totient is φ = 121227805855416.
The previous prime is 131330123010181. The next prime is 131330123010209. The reversal of 131330123010203 is 302010321033131.
It is not a de Polignac number, because 131330123010203 - 26 = 131330123010139 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131330123010209) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 388550659625 + ... + 388550659962.
It is an arithmetic number, because the mean of its divisors is an integer number (23701590247434).
Almost surely, 2131330123010203 is an apocalyptic number.
131330123010203 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
131330123010203 is a deficient number, since it is larger than the sum of its proper divisors (10879418474401).
131330123010203 is an equidigital number, since it uses as much as digits as its factorization.
131330123010203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777101319613 (or 777101319600 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 131330123010203 its reverse (302010321033131), we get a palindrome (433340444043334).
The spelling of 131330123010203 in words is "one hundred thirty-one trillion, three hundred thirty billion, one hundred twenty-three million, ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •