Base | Representation |
---|---|
bin | 100011011111000100011001… |
… | …0100011011101000000001101 |
3 | 1111221011122121110011122210120 |
4 | 1012332020302203131000031 |
5 | 311402443000131033031 |
6 | 3023504020434255153 |
7 | 122513613121063161 |
oct | 10676106243350015 |
9 | 1457148543148716 |
10 | 312133301424141 |
11 | 90500a983a025a |
12 | 2b0116371274b9 |
13 | 10522075959822 |
14 | 571149214aca1 |
15 | 2614484377a96 |
hex | 11be2328dd00d |
312133301424141 has 8 divisors (see below), whose sum is σ = 418290312569184. Its totient is φ = 207032578947600.
The previous prime is 312133301424127. The next prime is 312133301424143. The reversal of 312133301424141 is 141424103331213.
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 312133301424141 - 222 = 312133297229837 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312133301424143) 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, 264072166435 + ... + 264072167616.
It is an arithmetic number, because the mean of its divisors is an integer number (52286289071148).
Almost surely, 2312133301424141 is an apocalyptic number.
It is an amenable number.
312133301424141 is a deficient number, since it is larger than the sum of its proper divisors (106157011145043).
312133301424141 is a wasteful number, since it uses less digits than its factorization.
312133301424141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 528144334251.
The product of its (nonzero) digits is 20736, while the sum is 33.
Adding to 312133301424141 its reverse (141424103331213), we get a palindrome (453557404755354).
The spelling of 312133301424141 in words is "three hundred twelve trillion, one hundred thirty-three billion, three hundred one million, four hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •