Base | Representation |
---|---|
bin | 100011100000100110001011… |
… | …1011100011111000110001111 |
3 | 1111221220201122121120011002221 |
4 | 1013001030113130133012033 |
5 | 311414413034300313013 |
6 | 3024144310421000211 |
7 | 122535026101443325 |
oct | 10701142734370617 |
9 | 1457821577504087 |
10 | 312343300010383 |
11 | 905820600a0274 |
12 | 2b046283253067 |
13 | 10538b0158c805 |
14 | 571b6d4103d15 |
15 | 2619b754cb08d |
hex | 11c131771f18f |
312343300010383 has 2 divisors, whose sum is σ = 312343300010384. Its totient is φ = 312343300010382.
The previous prime is 312343300010369. The next prime is 312343300010431. The reversal of 312343300010383 is 383010003343213.
It is a weak prime.
It is an emirp because it is prime and its reverse (383010003343213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 312343300010383 - 213 = 312343300002191 is a prime.
It is a super-2 number, since 2×3123433000103832 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312343300010683) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156171650005191 + 156171650005192.
It is an arithmetic number, because the mean of its divisors is an integer number (156171650005192).
Almost surely, 2312343300010383 is an apocalyptic number.
312343300010383 is a deficient number, since it is larger than the sum of its proper divisors (1).
312343300010383 is an equidigital number, since it uses as much as digits as its factorization.
312343300010383 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 34.
Adding to 312343300010383 its reverse (383010003343213), we get a palindrome (695353303353596).
The spelling of 312343300010383 in words is "three hundred twelve trillion, three hundred forty-three billion, three hundred million, ten thousand, three hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •