Base | Representation |
---|---|
bin | 100011100000100110000110… |
… | …1010100011010010000011001 |
3 | 1111221220201012202212220000111 |
4 | 1013001030031110122100121 |
5 | 311414412212302334431 |
6 | 3024144241511404321 |
7 | 122535021636425602 |
oct | 10701141524322031 |
9 | 1457821182786014 |
10 | 312343130121241 |
11 | 90581a8320401a |
12 | 2b0462363836a1 |
13 | 10538aa5318aab |
14 | 571b6b971cda9 |
15 | 2619b6561d7b1 |
hex | 11c130d51a419 |
312343130121241 has 16 divisors (see below), whose sum is σ = 321664257824256. Its totient is φ = 303069300782976.
The previous prime is 312343130121181. The next prime is 312343130121283. The reversal of 312343130121241 is 142121031343213.
It is a cyclic number.
It is not a de Polignac number, because 312343130121241 - 233 = 312334540186649 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (312343130521241) 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, 15168120 + ... + 29236246.
It is an arithmetic number, because the mean of its divisors is an integer number (20104016114016).
Almost surely, 2312343130121241 is an apocalyptic number.
It is an amenable number.
312343130121241 is a deficient number, since it is larger than the sum of its proper divisors (9321127703015).
312343130121241 is a wasteful number, since it uses less digits than its factorization.
312343130121241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14069808.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 312343130121241 its reverse (142121031343213), we get a palindrome (454464161464454).
The spelling of 312343130121241 in words is "three hundred twelve trillion, three hundred forty-three billion, one hundred thirty million, one hundred twenty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •