Base | Representation |
---|---|
bin | 1100111100010111011001… |
… | …0001110100001011100001 |
3 | 1212101111020120021102000201 |
4 | 3033011312101310023201 |
5 | 3331131010011031223 |
6 | 50133421133545201 |
7 | 2666112450613561 |
oct | 317056621641341 |
9 | 55344216242021 |
10 | 14231211033313 |
11 | 459747169209a |
12 | 171a12b945201 |
13 | 7c2cc74c3671 |
14 | 372b1975ada1 |
15 | 19a2be465ead |
hex | cf1764742e1 |
14231211033313 has 2 divisors, whose sum is σ = 14231211033314. Its totient is φ = 14231211033312.
The previous prime is 14231211033307. The next prime is 14231211033343. The reversal of 14231211033313 is 31333011213241.
14231211033313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11151438748129 + 3079772285184 = 3339377^2 + 1754928^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14231211033313 is a prime.
It is not a weakly prime, because it can be changed into another prime (14231211033343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7115605516656 + 7115605516657.
It is an arithmetic number, because the mean of its divisors is an integer number (7115605516657).
Almost surely, 214231211033313 is an apocalyptic number.
It is an amenable number.
14231211033313 is a deficient number, since it is larger than the sum of its proper divisors (1).
14231211033313 is an equidigital number, since it uses as much as digits as its factorization.
14231211033313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 14231211033313 its reverse (31333011213241), we get a palindrome (45564222246554).
The spelling of 14231211033313 in words is "fourteen trillion, two hundred thirty-one billion, two hundred eleven million, thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •