Base | Representation |
---|---|
bin | 11101110010011101110010… |
… | …001011011010000111000001 |
3 | 122011212120001222001202221212 |
4 | 131302131302023122013001 |
5 | 114132442122033214131 |
6 | 1142345432311255505 |
7 | 36411153135443450 |
oct | 3562356213320701 |
9 | 564776058052855 |
10 | 131011303023041 |
11 | 3882064410a681 |
12 | 1283aa5037a595 |
13 | 581440b49412c |
14 | 244cda3834b97 |
15 | 1022d882a8a2b |
hex | 7727722da1c1 |
131011303023041 has 8 divisors (see below), whose sum is σ = 149728810732800. Its totient is φ = 112294197132768.
The previous prime is 131011303023019. The next prime is 131011303023071. The reversal of 131011303023041 is 140320303110131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-131011303023041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131011303022998 and 131011303023016.
It is not an unprimeable number, because it can be changed into a prime (131011303023071) 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, 99755876 + ... + 101060661.
It is an arithmetic number, because the mean of its divisors is an integer number (18716101341600).
Almost surely, 2131011303023041 is an apocalyptic number.
It is an amenable number.
131011303023041 is a deficient number, since it is larger than the sum of its proper divisors (18717507709759).
131011303023041 is an equidigital number, since it uses as much as digits as its factorization.
131011303023041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200909743.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 131011303023041 its reverse (140320303110131), we get a palindrome (271331606133172).
The spelling of 131011303023041 in words is "one hundred thirty-one trillion, eleven billion, three hundred three million, twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •