Base | Representation |
---|---|
bin | 11101110100001101010001… |
… | …011001010011101101011001 |
3 | 122012022000001200211010012000 |
4 | 131310031101121103231121 |
5 | 114141422303044244001 |
6 | 1142520431052311213 |
7 | 36422621503024461 |
oct | 3564152131235531 |
9 | 565260050733160 |
10 | 131131012103001 |
11 | 38867393832209 |
12 | 1285a09a772509 |
13 | 58227a830c561 |
14 | 2454abc28cba1 |
15 | 1026042945a86 |
hex | 774351653b59 |
131131012103001 has 8 divisors (see below), whose sum is σ = 194268166078560. Its totient is φ = 87420674735316.
The previous prime is 131131012102999. The next prime is 131131012103023. The reversal of 131131012103001 is 100301210131131.
131131012103001 is a `hidden beast` number, since 1 + 31 + 1 + 310 + 1 + 21 + 0 + 300 + 1 = 666.
It is not a de Polignac number, because 131131012103001 - 21 = 131131012102999 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (131131012103401) 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, 2428352075955 + ... + 2428352076008.
It is an arithmetic number, because the mean of its divisors is an integer number (24283520759820).
Almost surely, 2131131012103001 is an apocalyptic number.
It is an amenable number.
131131012103001 is a deficient number, since it is larger than the sum of its proper divisors (63137153975559).
131131012103001 is an equidigital number, since it uses as much as digits as its factorization.
131131012103001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4856704151972 (or 4856704151966 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 131131012103001 its reverse (100301210131131), we get a palindrome (231432222234132).
The spelling of 131131012103001 in words is "one hundred thirty-one trillion, one hundred thirty-one billion, twelve million, one hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •