Base | Representation |
---|---|
bin | 100011011110001011101000… |
… | …1111111111000110111001011 |
3 | 1111220202000000111021221022011 |
4 | 1012330113101333320313023 |
5 | 311343443343113412133 |
6 | 3023332022500040351 |
7 | 122502036624361105 |
oct | 10674272177706713 |
9 | 1456660014257264 |
10 | 312011422404043 |
11 | 9046433490a56a |
12 | 2abb1aa20930b7 |
13 | 105137213a605b |
14 | 570960d43c575 |
15 | 26111ee45a6cd |
hex | 11bc5d1ff8dcb |
312011422404043 has 2 divisors, whose sum is σ = 312011422404044. Its totient is φ = 312011422404042.
The previous prime is 312011422404037. The next prime is 312011422404139. The reversal of 312011422404043 is 340404224110213.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 312011422404043 - 221 = 312011420306891 is a prime.
It is a super-2 number, since 2×3120114224040432 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 312011422403996 and 312011422404014.
It is not a weakly prime, because it can be changed into another prime (312011422434043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156005711202021 + 156005711202022.
It is an arithmetic number, because the mean of its divisors is an integer number (156005711202022).
Almost surely, 2312011422404043 is an apocalyptic number.
312011422404043 is a deficient number, since it is larger than the sum of its proper divisors (1).
312011422404043 is an equidigital number, since it uses as much as digits as its factorization.
312011422404043 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 312011422404043 its reverse (340404224110213), we get a palindrome (652415646514256).
The spelling of 312011422404043 in words is "three hundred twelve trillion, eleven billion, four hundred twenty-two million, four hundred four thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •