Base | Representation |
---|---|
bin | 1100101111100100001111… |
… | …0100000100110101100001 |
3 | 1211121110200001110121000100 |
4 | 3023321003310010311201 |
5 | 3314030141141404241 |
6 | 45444413444213013 |
7 | 2644166411551506 |
oct | 313710364046541 |
9 | 54543601417010 |
10 | 14011321044321 |
11 | 4512193500867 |
12 | 16a35a309a169 |
13 | 7a8353536c43 |
14 | 366219c2d4ad |
15 | 1946eec569b6 |
hex | cbe43d04d61 |
14011321044321 has 12 divisors (see below), whose sum is σ = 20239617406372. Its totient is φ = 9340399512576.
The previous prime is 14011321044209. The next prime is 14011321044353. The reversal of 14011321044321 is 12344012311041.
It is a happy number.
14011321044321 is a `hidden beast` number, since 1 + 4 + 0 + 1 + 1 + 3 + 210 + 443 + 2 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 2344389699600 + 11666931344721 = 1531140^2 + 3415689^2 .
It is not a de Polignac number, because 14011321044321 - 211 = 14011321042273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14011321042321) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 39914176 + ... + 40263681.
Almost surely, 214011321044321 is an apocalyptic number.
It is an amenable number.
14011321044321 is a deficient number, since it is larger than the sum of its proper divisors (6228296362051).
14011321044321 is a wasteful number, since it uses less digits than its factorization.
14011321044321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80197280 (or 80197277 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 14011321044321 its reverse (12344012311041), we get a palindrome (26355333355362).
The spelling of 14011321044321 in words is "fourteen trillion, eleven billion, three hundred twenty-one million, forty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •