Base | Representation |
---|---|
bin | 100011011111001000001011… |
… | …1001111000010001101110110 |
3 | 1111221012102121011012121001210 |
4 | 1012332100113033002031312 |
5 | 311403111123323140202 |
6 | 3023511443354502250 |
7 | 122514321460365423 |
oct | 10676202717021566 |
9 | 1457172534177053 |
10 | 312141433021302 |
11 | 90504490480595 |
12 | 2b013126434986 |
13 | 10522a70527391 |
14 | 5711a240acd4a |
15 | 26147ad1b9c6c |
hex | 11be4173c2376 |
312141433021302 has 32 divisors (see below), whose sum is σ = 624377669083488. Its totient is φ = 104031344791296.
The previous prime is 312141433021261. The next prime is 312141433021349. The reversal of 312141433021302 is 203120334141213.
It is a super-2 number, since 2×3121414330213022 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 312141433021302.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1549042068 + ... + 1549243560.
It is an arithmetic number, because the mean of its divisors is an integer number (19511802158859).
Almost surely, 2312141433021302 is an apocalyptic number.
312141433021302 is an abundant number, since it is smaller than the sum of its proper divisors (312236236062186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
312141433021302 is a wasteful number, since it uses less digits than its factorization.
312141433021302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239424.
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 312141433021302 its reverse (203120334141213), we get a palindrome (515261767162515).
The spelling of 312141433021302 in words is "three hundred twelve trillion, one hundred forty-one billion, four hundred thirty-three million, twenty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •