Base | Representation |
---|---|
bin | 1100110011101111101010… |
… | …0010000101110001111000 |
3 | 1211212022221212121001022120 |
4 | 3030323322202011301320 |
5 | 3321214200121134411 |
6 | 45541404541521240 |
7 | 2652320332122153 |
oct | 314737242056170 |
9 | 54768855531276 |
10 | 14083106036856 |
11 | 453a68023717a |
12 | 16b5497873220 |
13 | 7b205371879c |
14 | 3698a9932c9a |
15 | 196501e09106 |
hex | ccefa885c78 |
14083106036856 has 32 divisors (see below), whose sum is σ = 37278810098640. Its totient is φ = 4418229344768.
The previous prime is 14083106036767. The next prime is 14083106036927. The reversal of 14083106036856 is 65863060138041.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 14083106036799 and 14083106036808.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 17258707971 + ... + 17258708786.
Almost surely, 214083106036856 is an apocalyptic number.
It is an amenable number.
14083106036856 is an abundant number, since it is smaller than the sum of its proper divisors (23195704061784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14083106036856 is a wasteful number, since it uses less digits than its factorization.
14083106036856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34517416783 (or 34517416779 counting only the distinct ones).
The product of its (nonzero) digits is 2488320, while the sum is 51.
The spelling of 14083106036856 in words is "fourteen trillion, eighty-three billion, one hundred six million, thirty-six thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •