Base | Representation |
---|---|
bin | 1100110111111110001010… |
… | …1010101100111011101111 |
3 | 1212010021101110201220102122 |
4 | 3031333202222230323233 |
5 | 3323411403320211411 |
6 | 50035014212543155 |
7 | 2660500640263124 |
oct | 315774252547357 |
9 | 55107343656378 |
10 | 14155720085231 |
11 | 4568452a494aa |
12 | 1707582021abb |
13 | 7b8b565b450a |
14 | 36d1d77a674b |
15 | 198351c729db |
hex | cdfe2aaceef |
14155720085231 has 8 divisors (see below), whose sum is σ = 14160742995984. Its totient is φ = 14150697865920.
The previous prime is 14155720085191. The next prime is 14155720085251. The reversal of 14155720085231 is 13258002755141.
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 14155720085231 - 230 = 14154646343407 is a prime.
It is a super-2 number, since 2×141557200852312 (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 (14155720085251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42645041 + ... + 42975701.
It is an arithmetic number, because the mean of its divisors is an integer number (1770092874498).
Almost surely, 214155720085231 is an apocalyptic number.
14155720085231 is a deficient number, since it is larger than the sum of its proper divisors (5022910753).
14155720085231 is a wasteful number, since it uses less digits than its factorization.
14155720085231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345721.
The product of its (nonzero) digits is 336000, while the sum is 44.
The spelling of 14155720085231 in words is "fourteen trillion, one hundred fifty-five billion, seven hundred twenty million, eighty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •