Base | Representation |
---|---|
bin | 1100110000111100011110… |
… | …0101101100110111100111 |
3 | 1211200201210202012211101212 |
4 | 3030033013211230313213 |
5 | 3314422143204031002 |
6 | 45503332034142035 |
7 | 2645665356421262 |
oct | 314170745546747 |
9 | 54621722184355 |
10 | 14035006705127 |
11 | 4521238436351 |
12 | 16a80b342191b |
13 | 7aa659684855 |
14 | 367425801cd9 |
15 | 195139355352 |
hex | cc3c796cde7 |
14035006705127 has 8 divisors (see below), whose sum is σ = 14224051886160. Its totient is φ = 13846943577600.
The previous prime is 14035006705051. The next prime is 14035006705147. The reversal of 14035006705127 is 72150760053041.
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 14035006705127 - 224 = 14034989927911 is a prime.
It is a super-2 number, since 2×140350067051272 (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 (14035006705147) 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, 245484602 + ... + 245541767.
It is an arithmetic number, because the mean of its divisors is an integer number (1778006485770).
Almost surely, 214035006705127 is an apocalyptic number.
14035006705127 is a deficient number, since it is larger than the sum of its proper divisors (189045181033).
14035006705127 is a wasteful number, since it uses less digits than its factorization.
14035006705127 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 491026753.
The product of its (nonzero) digits is 176400, while the sum is 41.
Adding to 14035006705127 its reverse (72150760053041), we get a palindrome (86185766758168).
The spelling of 14035006705127 in words is "fourteen trillion, thirty-five billion, six million, seven hundred five thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •