Base | Representation |
---|---|
bin | 11101110110111101100100… |
… | …000001100101001100111011 |
3 | 122012222002122201102201222201 |
4 | 131312331210001211030323 |
5 | 114203022440110230243 |
6 | 1143143414153531031 |
7 | 36442402350633112 |
oct | 3566754401451473 |
9 | 565862581381881 |
10 | 131320303211323 |
11 | 3892a69a716606 |
12 | 1288a907a13a77 |
13 | 58375b3b0a925 |
14 | 245dd17ddac79 |
15 | 102ae20b8004d |
hex | 776f6406533b |
131320303211323 has 2 divisors, whose sum is σ = 131320303211324. Its totient is φ = 131320303211322.
The previous prime is 131320303211297. The next prime is 131320303211353. The reversal of 131320303211323 is 323112303023131.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (323112303023131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131320303211323 - 25 = 131320303211291 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131320303211291 and 131320303211300.
It is not a weakly prime, because it can be changed into another prime (131320303211353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65660151605661 + 65660151605662.
It is an arithmetic number, because the mean of its divisors is an integer number (65660151605662).
Almost surely, 2131320303211323 is an apocalyptic number.
131320303211323 is a deficient number, since it is larger than the sum of its proper divisors (1).
131320303211323 is an equidigital number, since it uses as much as digits as its factorization.
131320303211323 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 131320303211323 its reverse (323112303023131), we get a palindrome (454432606234454).
The spelling of 131320303211323 in words is "one hundred thirty-one trillion, three hundred twenty billion, three hundred three million, two hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •