Base | Representation |
---|---|
bin | 1100110110001101011010… |
… | …1111110111111110001101 |
3 | 1212000101021021021201200021 |
4 | 3031203112233313332031 |
5 | 3322412413031443001 |
6 | 50013051122302141 |
7 | 2655346644233365 |
oct | 315432657677615 |
9 | 55011237251607 |
10 | 14125455343501 |
11 | 4556632323057 |
12 | 17017364b7951 |
13 | 7b6042417b08 |
14 | 36b9661259a5 |
15 | 19767eca1ba1 |
hex | cd8d6bf7f8d |
14125455343501 has 24 divisors (see below), whose sum is σ = 16180234983360. Its totient is φ = 12287641996800.
The previous prime is 14125455343481. The next prime is 14125455343513. The reversal of 14125455343501 is 10534355452141.
It is not a de Polignac number, because 14125455343501 - 211 = 14125455341453 is a prime.
It is a super-2 number, since 2×141254553435012 (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 (14125455343541) 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 23 ways as a sum of consecutive naturals, for example, 31146505 + ... + 31596766.
It is an arithmetic number, because the mean of its divisors is an integer number (674176457640).
Almost surely, 214125455343501 is an apocalyptic number.
It is an amenable number.
14125455343501 is a deficient number, since it is larger than the sum of its proper divisors (2054779639859).
14125455343501 is a wasteful number, since it uses less digits than its factorization.
14125455343501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62743365 (or 62743348 counting only the distinct ones).
The product of its (nonzero) digits is 720000, while the sum is 43.
The spelling of 14125455343501 in words is "fourteen trillion, one hundred twenty-five billion, four hundred fifty-five million, three hundred forty-three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •