Base | Representation |
---|---|
bin | 100011011110110110110000… |
… | …0001111010111111000000011 |
3 | 1111221001211222121021200011022 |
4 | 1012331231200033113320003 |
5 | 311402002444301003443 |
6 | 3023442333310340055 |
7 | 122511525101556344 |
oct | 10675554017277003 |
9 | 1457054877250138 |
10 | 312104003141123 |
11 | 9049a623269616 |
12 | 2b007a1b1ba62b |
13 | 1051c386a8549b |
14 | 570dcb2da60cb |
15 | 261381c15ee68 |
hex | 11bdb603d7e03 |
312104003141123 has 2 divisors, whose sum is σ = 312104003141124. Its totient is φ = 312104003141122.
The previous prime is 312104003141113. The next prime is 312104003141153. The reversal of 312104003141123 is 321141300401213.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 312104003141123 - 230 = 312102929399299 is a prime.
It is a super-2 number, since 2×3121040031411232 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 312104003141092 and 312104003141101.
It is not a weakly prime, because it can be changed into another prime (312104003141113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156052001570561 + 156052001570562.
It is an arithmetic number, because the mean of its divisors is an integer number (156052001570562).
Almost surely, 2312104003141123 is an apocalyptic number.
312104003141123 is a deficient number, since it is larger than the sum of its proper divisors (1).
312104003141123 is an equidigital number, since it uses as much as digits as its factorization.
312104003141123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 312104003141123 its reverse (321141300401213), we get a palindrome (633245303542336).
The spelling of 312104003141123 in words is "three hundred twelve trillion, one hundred four billion, three million, one hundred forty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •