Base | Representation |
---|---|
bin | 1100110000110001011000… |
… | …1110110000011010011101 |
3 | 1211200110010101010121020011 |
4 | 3030030112032300122131 |
5 | 3314400044431414401 |
6 | 45502120501123221 |
7 | 2645531545405105 |
oct | 314142616603235 |
9 | 54613111117204 |
10 | 14032031123101 |
11 | 451aa50833552 |
12 | 16a76029b9511 |
13 | 7aa2a406c624 |
14 | 367222554205 |
15 | 195012ed6451 |
hex | cc3163b069d |
14032031123101 has 8 divisors (see below), whose sum is σ = 14331667248000. Its totient is φ = 13732440092928.
The previous prime is 14032031123021. The next prime is 14032031123197. The reversal of 14032031123101 is 10132113023041.
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 14032031123101 - 29 = 14032031122589 is a prime.
It is a super-2 number, since 2×140320311231012 (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 (14032731123101) 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, 10644331 + ... + 11889736.
It is an arithmetic number, because the mean of its divisors is an integer number (1791458406000).
Almost surely, 214032031123101 is an apocalyptic number.
It is an amenable number.
14032031123101 is a deficient number, since it is larger than the sum of its proper divisors (299636124899).
14032031123101 is a wasteful number, since it uses less digits than its factorization.
14032031123101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22547363.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 14032031123101 its reverse (10132113023041), we get a palindrome (24164144146142).
The spelling of 14032031123101 in words is "fourteen trillion, thirty-two billion, thirty-one million, one hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •