Base | Representation |
---|---|
bin | 1000001110000111111… |
… | …0000111011001101001 |
3 | 111111112120100221212102 |
4 | 2003201332013121221 |
5 | 4303214402012223 |
6 | 144514043223145 |
7 | 13126546062515 |
oct | 2034176073151 |
9 | 444476327772 |
10 | 141230110313 |
11 | 54993796236 |
12 | 23455817ab5 |
13 | 10419699716 |
14 | 6b9ab59145 |
15 | 3a18c08928 |
hex | 20e1f87669 |
141230110313 has 2 divisors, whose sum is σ = 141230110314. Its totient is φ = 141230110312.
The previous prime is 141230110291. The next prime is 141230110321. The reversal of 141230110313 is 313011032141.
141230110313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 133285596889 + 7944513424 = 365083^2 + 89132^2 .
It is a cyclic number.
It is not a de Polignac number, because 141230110313 - 216 = 141230044777 is a prime.
It is not a weakly prime, because it can be changed into another prime (141230110013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70615055156 + 70615055157.
It is an arithmetic number, because the mean of its divisors is an integer number (70615055157).
Almost surely, 2141230110313 is an apocalyptic number.
It is an amenable number.
141230110313 is a deficient number, since it is larger than the sum of its proper divisors (1).
141230110313 is an equidigital number, since it uses as much as digits as its factorization.
141230110313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 141230110313 its reverse (313011032141), we get a palindrome (454241142454).
The spelling of 141230110313 in words is "one hundred forty-one billion, two hundred thirty million, one hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •