Base | Representation |
---|---|
bin | 1100101111100100001111… |
… | …0100000001111000111101 |
3 | 1211121110200001102222110101 |
4 | 3023321003310001320331 |
5 | 3314030141141013003 |
6 | 45444413444041101 |
7 | 2644166411501356 |
oct | 313710364017075 |
9 | 54543601388411 |
10 | 14011321032253 |
11 | 45121934a2796 |
12 | 16a35a3093191 |
13 | 7a83535315bc |
14 | 366219c28d2d |
15 | 1946eec5311d |
hex | cbe43d01e3d |
14011321032253 has 2 divisors, whose sum is σ = 14011321032254. Its totient is φ = 14011321032252.
The previous prime is 14011321032217. The next prime is 14011321032271. The reversal of 14011321032253 is 35223012311041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10707207762969 + 3304113269284 = 3272187^2 + 1817722^2 .
It is a cyclic number.
It is not a de Polignac number, because 14011321032253 - 225 = 14011287477821 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14011321092253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7005660516126 + 7005660516127.
It is an arithmetic number, because the mean of its divisors is an integer number (7005660516127).
Almost surely, 214011321032253 is an apocalyptic number.
It is an amenable number.
14011321032253 is a deficient number, since it is larger than the sum of its proper divisors (1).
14011321032253 is an equidigital number, since it uses as much as digits as its factorization.
14011321032253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 14011321032253 its reverse (35223012311041), we get a palindrome (49234333343294).
The spelling of 14011321032253 in words is "fourteen trillion, eleven billion, three hundred twenty-one million, thirty-two thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •