Base | Representation |
---|---|
bin | 1101001110011101010111… |
… | …1001111001010110110111 |
3 | 1220111012120200022111000110 |
4 | 3103213111321321112313 |
5 | 3401224111033133421 |
6 | 50532305452314103 |
7 | 3030425426122140 |
oct | 323472571712667 |
9 | 56435520274013 |
10 | 14542053021111 |
11 | 46a7282902290 |
12 | 176a420172933 |
13 | 8164045a3b65 |
14 | 383ba679aac7 |
15 | 1a34138a0a76 |
hex | d39d5e795b7 |
14542053021111 has 16 divisors (see below), whose sum is σ = 24173802425088. Its totient is φ = 7554313257600.
The previous prime is 14542053021071. The next prime is 14542053021157. The reversal of 14542053021111 is 11112035024541.
It is not a de Polignac number, because 14542053021111 - 217 = 14542052890039 is a prime.
It is a super-2 number, since 2×145420530211112 (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 (14542053021311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31476305010 + ... + 31476305471.
It is an arithmetic number, because the mean of its divisors is an integer number (1510862651568).
Almost surely, 214542053021111 is an apocalyptic number.
14542053021111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
14542053021111 is a deficient number, since it is larger than the sum of its proper divisors (9631749403977).
14542053021111 is a wasteful number, since it uses less digits than its factorization.
14542053021111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62952610502.
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 14542053021111 its reverse (11112035024541), we get a palindrome (25654088045652).
The spelling of 14542053021111 in words is "fourteen trillion, five hundred forty-two billion, fifty-three million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •