Base | Representation |
---|---|
bin | 1100110001000000100010… |
… | …0010000100101010011111 |
3 | 1211200211121200102121121120 |
4 | 3030100020202010222133 |
5 | 3314431411121214210 |
6 | 45504032115302023 |
7 | 2646034356535203 |
oct | 314201042045237 |
9 | 54624550377546 |
10 | 14036096273055 |
11 | 452174747590a |
12 | 16a83582aa913 |
13 | 7aa7a13220bc |
14 | 3674ca3c6b03 |
15 | 19519ed2a270 |
hex | cc408884a9f |
14036096273055 has 32 divisors (see below), whose sum is σ = 22510081440000. Its totient is φ = 7468485315072.
The previous prime is 14036096273047. The next prime is 14036096273077. The reversal of 14036096273055 is 55037269063041.
It is a happy number.
It is not a de Polignac number, because 14036096273055 - 23 = 14036096273047 is a prime.
It is a super-2 number, since 2×140360962730552 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14036096272989 and 14036096273007.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22817632 + ... + 23424698.
It is an arithmetic number, because the mean of its divisors is an integer number (703440045000).
Almost surely, 214036096273055 is an apocalyptic number.
14036096273055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14036096273055 is a deficient number, since it is larger than the sum of its proper divisors (8473985166945).
14036096273055 is a wasteful number, since it uses less digits than its factorization.
14036096273055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 610663.
The product of its (nonzero) digits is 4082400, while the sum is 51.
The spelling of 14036096273055 in words is "fourteen trillion, thirty-six billion, ninety-six million, two hundred seventy-three thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •