Base | Representation |
---|---|
bin | 100010011110010111001100… |
… | …0010010100011011101001101 |
3 | 1110202200110210010001120201012 |
4 | 1010330232120102203131031 |
5 | 304221241242014001031 |
6 | 2552534332032255005 |
7 | 120605243063526446 |
oct | 10474563022433515 |
9 | 1422613703046635 |
10 | 303240131000141 |
11 | 8869246554a815 |
12 | 2a015b763a1465 |
13 | 100285634b21ca |
14 | 54c4c8755c2cd |
15 | 250ce89788b2b |
hex | 113cb984a374d |
303240131000141 has 8 divisors (see below), whose sum is σ = 311733886297344. Its totient is φ = 294798644966880.
The previous prime is 303240131000077. The next prime is 303240131000143. The reversal of 303240131000141 is 141000131042303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 303240131000141 - 26 = 303240131000077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (303240131000143) 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, 13067304221 + ... + 13067327426.
It is an arithmetic number, because the mean of its divisors is an integer number (38966735787168).
Almost surely, 2303240131000141 is an apocalyptic number.
It is an amenable number.
303240131000141 is a deficient number, since it is larger than the sum of its proper divisors (8493755297203).
303240131000141 is a wasteful number, since it uses less digits than its factorization.
303240131000141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26134631971.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 303240131000141 its reverse (141000131042303), we get a palindrome (444240262042444).
The spelling of 303240131000141 in words is "three hundred three trillion, two hundred forty billion, one hundred thirty-one million, one hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.191 sec. • engine limits •