Base | Representation |
---|---|
bin | 1000110001010001011… |
… | …10111100010101110100 |
3 | 1001210210021122011201111 |
4 | 10120220232330111310 |
5 | 14414111230331030 |
6 | 350232443204404 |
7 | 30525160063342 |
oct | 4305056742564 |
9 | 1053707564644 |
10 | 301331105140 |
11 | 10688060a29a |
12 | 4a497216704 |
13 | 225528378a0 |
14 | 10827c3c992 |
15 | 7c8949562a |
hex | 4628bbc574 |
301331105140 has 48 divisors (see below), whose sum is σ = 683171551440. Its totient is φ = 110983219200.
The previous prime is 301331105113. The next prime is 301331105147. The reversal of 301331105140 is 41501133103.
It can be written as a sum of positive squares in 8 ways, for example, as 9776463376 + 291554641764 = 98876^2 + 539958^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301331105147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1340835 + ... + 1549354.
It is an arithmetic number, because the mean of its divisors is an integer number (14232740655).
Almost surely, 2301331105140 is an apocalyptic number.
It is an amenable number.
301331105140 is an abundant number, since it is smaller than the sum of its proper divisors (381840446300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
301331105140 is a wasteful number, since it uses less digits than its factorization.
301331105140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2890612 (or 2890610 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 22.
Adding to 301331105140 its reverse (41501133103), we get a palindrome (342832238243).
The spelling of 301331105140 in words is "three hundred one billion, three hundred thirty-one million, one hundred five thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •