Base | Representation |
---|---|
bin | 1101000000011000001000… |
… | …1111111011001011010011 |
3 | 1212122002010201222210111112 |
4 | 3100012002033323023103 |
5 | 3333243132110403021 |
6 | 50225220055203535 |
7 | 3004102404560345 |
oct | 320060217731323 |
9 | 55562121883445 |
10 | 14300131341011 |
11 | 461371937a37a |
12 | 172b5650765ab |
13 | 7c965c04a819 |
14 | 3761b6bdd295 |
15 | 19bea4da2d5b |
hex | d01823fb2d3 |
14300131341011 has 8 divisors (see below), whose sum is σ = 14908781075760. Its totient is φ = 13704031085472.
The previous prime is 14300131341007. The next prime is 14300131341017. The reversal of 14300131341011 is 11014313100341.
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 14300131341011 - 22 = 14300131341007 is a prime.
It is a super-2 number, since 2×143001313410112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14300131341017) 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, 3137367476 + ... + 3137372033.
It is an arithmetic number, because the mean of its divisors is an integer number (1863597634470).
Almost surely, 214300131341011 is an apocalyptic number.
14300131341011 is a deficient number, since it is larger than the sum of its proper divisors (608649734749).
14300131341011 is an equidigital number, since it uses as much as digits as its factorization.
14300131341011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6274739605.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 14300131341011 its reverse (11014313100341), we get a palindrome (25314444441352).
The spelling of 14300131341011 in words is "fourteen trillion, three hundred billion, one hundred thirty-one million, three hundred forty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •