Base | Representation |
---|---|
bin | 1100111010101011010101… |
… | …0101111111101000100111 |
3 | 1212021201101001000211001012 |
4 | 3032222311111333220213 |
5 | 3330142103301303333 |
6 | 50112222543252435 |
7 | 2664034601625242 |
oct | 316526525775047 |
9 | 55251331024035 |
10 | 14202204322343 |
11 | 45861370a8894 |
12 | 17145955aa11b |
13 | 7c0353b58c6b |
14 | 3715671d4259 |
15 | 199672b44e48 |
hex | ceab557fa27 |
14202204322343 has 8 divisors (see below), whose sum is σ = 14310925896960. Its totient is φ = 14093487411640.
The previous prime is 14202204322291. The next prime is 14202204322367. The reversal of 14202204322343 is 34322340220241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14202204322343 - 220 = 14202203273767 is a prime.
It is a super-2 number, since 2×142022043223432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14202204322043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5074946 + ... + 7359312.
It is an arithmetic number, because the mean of its divisors is an integer number (1788865737120).
Almost surely, 214202204322343 is an apocalyptic number.
14202204322343 is a deficient number, since it is larger than the sum of its proper divisors (108721574617).
14202204322343 is a wasteful number, since it uses less digits than its factorization.
14202204322343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2331957.
The product of its (nonzero) digits is 55296, while the sum is 32.
Adding to 14202204322343 its reverse (34322340220241), we get a palindrome (48524544542584).
The spelling of 14202204322343 in words is "fourteen trillion, two hundred two billion, two hundred four million, three hundred twenty-two thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •