Base | Representation |
---|---|
bin | 111101001001011110… |
… | …0110000111001010101 |
3 | 110112221112020202201102 |
4 | 1322102330300321111 |
5 | 4122412442440313 |
6 | 140154111435445 |
7 | 12326044110344 |
oct | 1722274607125 |
9 | 415845222642 |
10 | 131314421333 |
11 | 50765627357 |
12 | 21548b25b85 |
13 | c4c92bb934 |
14 | 64d9ca1b5b |
15 | 3638451a58 |
hex | 1e92f30e55 |
131314421333 has 2 divisors, whose sum is σ = 131314421334. Its totient is φ = 131314421332.
The previous prime is 131314421299. The next prime is 131314421417. The reversal of 131314421333 is 333124413131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73017767524 + 58296653809 = 270218^2 + 241447^2 .
It is a cyclic number.
It is not a de Polignac number, because 131314421333 - 216 = 131314355797 is a prime.
It is a super-3 number, since 3×1313144213333 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131314421296 and 131314421305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131314421033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65657210666 + 65657210667.
It is an arithmetic number, because the mean of its divisors is an integer number (65657210667).
Almost surely, 2131314421333 is an apocalyptic number.
It is an amenable number.
131314421333 is a deficient number, since it is larger than the sum of its proper divisors (1).
131314421333 is an equidigital number, since it uses as much as digits as its factorization.
131314421333 is an evil number, because the sum of its binary digits is even.
The product of its digits is 7776, while the sum is 29.
Adding to 131314421333 its reverse (333124413131), we get a palindrome (464438834464).
The spelling of 131314421333 in words is "one hundred thirty-one billion, three hundred fourteen million, four hundred twenty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •