Base | Representation |
---|---|
bin | 1101000001010011110110… |
… | …1110110010011110001100 |
3 | 1212200121111220220001002211 |
4 | 3100110331232302132030 |
5 | 3334023444342014400 |
6 | 50240430501000204 |
7 | 3005210555261410 |
oct | 320247556623614 |
9 | 55617456801084 |
10 | 14316161673100 |
11 | 461a4a5052111 |
12 | 17326996b3064 |
13 | 7cb015193c21 |
14 | 376c97bc8d40 |
15 | 19c5e238adba |
hex | d053dbb278c |
14316161673100 has 36 divisors (see below), whose sum is σ = 35504080951024. Its totient is φ = 4908398287680.
The previous prime is 14316161673091. The next prime is 14316161673119. The reversal of 14316161673100 is 137616161341.
It is a super-2 number, since 2×143161616731002 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10225829067 + ... + 10225830466.
Almost surely, 214316161673100 is an apocalyptic number.
14316161673100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14316161673100 is an abundant number, since it is smaller than the sum of its proper divisors (21187919277924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14316161673100 is a wasteful number, since it uses less digits than its factorization.
14316161673100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20451659554 (or 20451659547 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 40.
The spelling of 14316161673100 in words is "fourteen trillion, three hundred sixteen billion, one hundred sixty-one million, six hundred seventy-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •