Base | Representation |
---|---|
bin | 1100110101111010010111… |
… | …1010010110110110011111 |
3 | 1211222220001211211012221012 |
4 | 3031132211322112312133 |
5 | 3322321424301244133 |
6 | 50010443425125435 |
7 | 2655106133333213 |
oct | 315364572266637 |
9 | 54886054735835 |
10 | 14120341040543 |
11 | 45544484455a1 |
12 | 170074978987b |
13 | 7b57089a844a |
14 | 36b5dcbcc943 |
15 | 197480cbcb48 |
hex | cd7a5e96d9f |
14120341040543 has 4 divisors (see below), whose sum is σ = 14131811668128. Its totient is φ = 14108870412960.
The previous prime is 14120341040513. The next prime is 14120341040549. The reversal of 14120341040543 is 34504014302141.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14120341040543 - 242 = 9722294529439 is a prime.
It is a super-2 number, since 2×141203410405432 (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 (14120341040549) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5735311946 + ... + 5735314407.
It is an arithmetic number, because the mean of its divisors is an integer number (3532952917032).
Almost surely, 214120341040543 is an apocalyptic number.
14120341040543 is a deficient number, since it is larger than the sum of its proper divisors (11470627585).
14120341040543 is a wasteful number, since it uses less digits than its factorization.
14120341040543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11470627584.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 14120341040543 its reverse (34504014302141), we get a palindrome (48624355342684).
The spelling of 14120341040543 in words is "fourteen trillion, one hundred twenty billion, three hundred forty-one million, forty thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •