Base | Representation |
---|---|
bin | 100011011111100100110111… |
… | …0101101001111100011111111 |
3 | 1111221102022120221222102020011 |
4 | 1012333021232231033203333 |
5 | 311410113301201201343 |
6 | 3024000031514004051 |
7 | 122521632062046043 |
oct | 10677115655174377 |
9 | 1457368527872204 |
10 | 312203030100223 |
11 | 9052861a414689 |
12 | 2b023057116627 |
13 | 10528808b06882 |
14 | 57149c8ad6023 |
15 | 26161b5c4129d |
hex | 11bf26eb4f8ff |
312203030100223 has 2 divisors, whose sum is σ = 312203030100224. Its totient is φ = 312203030100222.
The previous prime is 312203030100217. The next prime is 312203030100233. The reversal of 312203030100223 is 322001030302213.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 312203030100223 - 25 = 312203030100191 is a prime.
It is a super-2 number, since 2×3122030301002232 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 312203030100194 and 312203030100203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312203030100233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156101515050111 + 156101515050112.
It is an arithmetic number, because the mean of its divisors is an integer number (156101515050112).
Almost surely, 2312203030100223 is an apocalyptic number.
312203030100223 is a deficient number, since it is larger than the sum of its proper divisors (1).
312203030100223 is an equidigital number, since it uses as much as digits as its factorization.
312203030100223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 312203030100223 its reverse (322001030302213), we get a palindrome (634204060402436).
The spelling of 312203030100223 in words is "three hundred twelve trillion, two hundred three billion, thirty million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.924 sec. • engine limits •