Base | Representation |
---|---|
bin | 1001000101100001001… |
… | …01010100111000110011 |
3 | 1002211211202210102120221 |
4 | 10202300211110320303 |
5 | 20103341224021321 |
6 | 355231154113511 |
7 | 31361420041435 |
oct | 4426045247063 |
9 | 1084752712527 |
10 | 312200220211 |
11 | 110448981320 |
12 | 5060b27b897 |
13 | 235955c6a19 |
14 | 1117959c655 |
15 | 81c37cde41 |
hex | 48b0954e33 |
312200220211 has 8 divisors (see below), whose sum is σ = 340599817584. Its totient is φ = 283803582720.
The previous prime is 312200220179. The next prime is 312200220221. The reversal of 312200220211 is 112022002213.
It is a happy number.
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 312200220211 - 25 = 312200220179 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (312200220221) 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, 516486 + ... + 944011.
It is an arithmetic number, because the mean of its divisors is an integer number (42574977198).
Almost surely, 2312200220211 is an apocalyptic number.
312200220211 is a deficient number, since it is larger than the sum of its proper divisors (28399597373).
312200220211 is a wasteful number, since it uses less digits than its factorization.
312200220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1479941.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 312200220211 its reverse (112022002213), we get a palindrome (424222222424).
It can be divided in two parts, 3122002202 and 11, that added together give a palindrome (3122002213).
The spelling of 312200220211 in words is "three hundred twelve billion, two hundred million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •