Base | Representation |
---|---|
bin | 1100110001110101001000… |
… | …0010011111111101110111 |
3 | 1211202012001121012101120011 |
4 | 3030131102002133331313 |
5 | 3320144314342142101 |
6 | 45514325052121051 |
7 | 2650044260664451 |
oct | 314352202377567 |
9 | 54665047171504 |
10 | 14050214412151 |
11 | 4527731824765 |
12 | 16ab038466187 |
13 | 7abc11255b68 |
14 | 3680694532d1 |
15 | 1957294e7751 |
hex | cc75209ff77 |
14050214412151 has 4 divisors (see below), whose sum is σ = 14051685494304. Its totient is φ = 14048743330000.
The previous prime is 14050214412139. The next prime is 14050214412181. The reversal of 14050214412151 is 15121441205041.
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 14050214412151 - 211 = 14050214410103 is a prime.
It is a super-3 number, since 3×140502144121513 (a number of 40 digits) contains 333 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 (14050214412181) 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, 735526750 + ... + 735545851.
It is an arithmetic number, because the mean of its divisors is an integer number (3512921373576).
Almost surely, 214050214412151 is an apocalyptic number.
14050214412151 is a deficient number, since it is larger than the sum of its proper divisors (1471082153).
14050214412151 is an equidigital number, since it uses as much as digits as its factorization.
14050214412151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1471082152.
The product of its (nonzero) digits is 6400, while the sum is 31.
Adding to 14050214412151 its reverse (15121441205041), we get a palindrome (29171655617192).
The spelling of 14050214412151 in words is "fourteen trillion, fifty billion, two hundred fourteen million, four hundred twelve thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.788 sec. • engine limits •