Base | Representation |
---|---|
bin | 1100110100111000001000… |
… | …0111000110111011010111 |
3 | 1211221012011200122220122101 |
4 | 3031032002013012323113 |
5 | 3322024020444043411 |
6 | 45554343223142531 |
7 | 2653606411455331 |
oct | 315160207067327 |
9 | 54835150586571 |
10 | 14102560534231 |
11 | 454795384aa84 |
12 | 16b9206ba4a47 |
13 | 7b3b34098cb0 |
14 | 36a7d35ba451 |
15 | 196c8ed1e8c1 |
hex | cd3821c6ed7 |
14102560534231 has 8 divisors (see below), whose sum is σ = 15243414853184. Its totient is φ = 12969712211040.
The previous prime is 14102560534229. The next prime is 14102560534253. The reversal of 14102560534231 is 13243506520141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14102560534231 - 21 = 14102560534229 is a prime.
It is a super-2 number, since 2×141025605342312 (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 (14102560574231) 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 7 ways as a sum of consecutive naturals, for example, 2001495276 + ... + 2001502321.
It is an arithmetic number, because the mean of its divisors is an integer number (1905426856648).
Almost surely, 214102560534231 is an apocalyptic number.
14102560534231 is a deficient number, since it is larger than the sum of its proper divisors (1140854318953).
14102560534231 is a wasteful number, since it uses less digits than its factorization.
14102560534231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4002997881.
The product of its (nonzero) digits is 86400, while the sum is 37.
The spelling of 14102560534231 in words is "fourteen trillion, one hundred two billion, five hundred sixty million, five hundred thirty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •