Base | Representation |
---|---|
bin | 1001000101100100110… |
… | …00000111100010100111 |
3 | 1002211220212102020220110 |
4 | 10202302120013202213 |
5 | 20103421424441403 |
6 | 355234151104103 |
7 | 31362233602053 |
oct | 4426230074247 |
9 | 1084825366813 |
10 | 312230312103 |
11 | 110463964856 |
12 | 50619372033 |
13 | 2359b901788 |
14 | 1117d592c63 |
15 | 81c6275103 |
hex | 48b26078a7 |
312230312103 has 8 divisors (see below), whose sum is σ = 434407390848. Its totient is φ = 199103387384.
The previous prime is 312230312047. The next prime is 312230312111. The reversal of 312230312103 is 301213032213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 312230312103 - 28 = 312230311847 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 312230312103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312230312503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2262538425 + ... + 2262538562.
It is an arithmetic number, because the mean of its divisors is an integer number (54300923856).
Almost surely, 2312230312103 is an apocalyptic number.
312230312103 is a deficient number, since it is larger than the sum of its proper divisors (122177078745).
312230312103 is a wasteful number, since it uses less digits than its factorization.
312230312103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4525077013.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 312230312103 its reverse (301213032213), we get a palindrome (613443344316).
The spelling of 312230312103 in words is "three hundred twelve billion, two hundred thirty million, three hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •