Base | Representation |
---|---|
bin | 11101111000101110010110… |
… | …101000110110110011000101 |
3 | 122020101200020221221211000220 |
4 | 131320232112220312303011 |
5 | 114212014002312431401 |
6 | 1143315203435454553 |
7 | 36454220464663152 |
oct | 3570562650666305 |
9 | 566350227854026 |
10 | 131441411452101 |
11 | 38976a981043a3 |
12 | 128aa2868b7459 |
13 | 5845b4479c86a |
14 | 2465b265c9229 |
15 | 102e15d098336 |
hex | 778b96a36cc5 |
131441411452101 has 8 divisors (see below), whose sum is σ = 175255269606624. Its totient is φ = 87627580466160.
The previous prime is 131441411452051. The next prime is 131441411452129. The reversal of 131441411452101 is 101254114144131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131441411452101 - 227 = 131441277234373 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131441411452171) 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, 11649990 + ... + 19965096.
It is an arithmetic number, because the mean of its divisors is an integer number (21906908700828).
Almost surely, 2131441411452101 is an apocalyptic number.
It is an amenable number.
131441411452101 is a deficient number, since it is larger than the sum of its proper divisors (43813858154523).
131441411452101 is an equidigital number, since it uses as much as digits as its factorization.
131441411452101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13584291.
The product of its (nonzero) digits is 7680, while the sum is 33.
Adding to 131441411452101 its reverse (101254114144131), we get a palindrome (232695525596232).
The spelling of 131441411452101 in words is "one hundred thirty-one trillion, four hundred forty-one billion, four hundred eleven million, four hundred fifty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •