Base | Representation |
---|---|
bin | 1100110011101111111001… |
… | …1001100010000000000000 |
3 | 1211212100010101122112120220 |
4 | 3030323332121202000000 |
5 | 3321214313222331031 |
6 | 45541415220103040 |
7 | 2652322050351336 |
oct | 314737631420000 |
9 | 54770111575526 |
10 | 14083170902016 |
11 | 453a703910347 |
12 | 16b54b5534a80 |
13 | 7b2063caa038 |
14 | 3698b43b9b56 |
15 | 19650796d596 |
hex | ccefe662000 |
14083170902016 has 112 divisors (see below), whose sum is σ = 37587259490304. Its totient is φ = 4690086395904.
The previous prime is 14083170901997. The next prime is 14083170902051. The reversal of 14083170902016 is 61020907138041.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26599425 + ... + 27123711.
Almost surely, 214083170902016 is an apocalyptic number.
14083170902016 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14083170902016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18793629745152).
14083170902016 is an abundant number, since it is smaller than the sum of its proper divisors (23504088588288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14083170902016 is an equidigital number, since it uses as much as digits as its factorization.
14083170902016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525409 (or 525385 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 42.
The spelling of 14083170902016 in words is "fourteen trillion, eighty-three billion, one hundred seventy million, nine hundred two thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •