Base | Representation |
---|---|
bin | 1100110001111111100101… |
… | …0110000000110001100111 |
3 | 1211202110022012220012110220 |
4 | 3030133321112000301213 |
5 | 3320221041424303333 |
6 | 45515511402015423 |
7 | 2650203653223213 |
oct | 314377126006147 |
9 | 54673265805426 |
10 | 14053021322343 |
11 | 45289421a1953 |
12 | 16ab6a04a7573 |
13 | 7ac26a932473 |
14 | 368254155943 |
15 | 195840b498b3 |
hex | cc7f9580c67 |
14053021322343 has 16 divisors (see below), whose sum is σ = 19847361332736. Its totient is φ = 8814114531200.
The previous prime is 14053021322341. The next prime is 14053021322423. The reversal of 14053021322343 is 34322312035041.
It is a cyclic number.
It is not a de Polignac number, because 14053021322343 - 21 = 14053021322341 is a prime.
It is a super-2 number, since 2×140530213223432 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14053021322341) 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 in 15 ways as a sum of consecutive naturals, for example, 54048333 + ... + 54307718.
It is an arithmetic number, because the mean of its divisors is an integer number (1240460083296).
Almost surely, 214053021322343 is an apocalyptic number.
14053021322343 is a deficient number, since it is larger than the sum of its proper divisors (5794340010393).
14053021322343 is a wasteful number, since it uses less digits than its factorization.
14053021322343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108358614.
The product of its (nonzero) digits is 51840, while the sum is 33.
Adding to 14053021322343 its reverse (34322312035041), we get a palindrome (48375333357384).
The spelling of 14053021322343 in words is "fourteen trillion, fifty-three billion, twenty-one million, three hundred twenty-two thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •