Base | Representation |
---|---|
bin | 111011011011010110000… |
… | …001010010100101000100 |
3 | 112110102000201020011222220 |
4 | 323123112001102211010 |
5 | 1013402120223444133 |
6 | 12404024244252340 |
7 | 601021415541600 |
oct | 73332601224504 |
9 | 15412021204886 |
10 | 4083809593668 |
11 | 1334a30061872 |
12 | 55b5776a10b0 |
13 | 23814227658c |
14 | 10192c026500 |
15 | 71368b3c5b3 |
hex | 3b6d6052944 |
4083809593668 has 108 divisors (see below), whose sum is σ = 11110155695856. Its totient is φ = 1164116755200.
The previous prime is 4083809593519. The next prime is 4083809593679. The reversal of 4083809593668 is 8663959083804.
It is a Smith number, since the sum of its digits (69) coincides with the sum of the digits of its prime factors.
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 35 ways as a sum of consecutive naturals, for example, 1085828908 + ... + 1085832668.
Almost surely, 24083809593668 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4083809593668, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5555077847928).
4083809593668 is an abundant number, since it is smaller than the sum of its proper divisors (7026346102188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4083809593668 is an equidigital number, since it uses as much as digits as its factorization.
4083809593668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8034 (or 4264 counting only the distinct ones).
The product of its (nonzero) digits is 268738560, while the sum is 69.
The spelling of 4083809593668 in words is "four trillion, eighty-three billion, eight hundred nine million, five hundred ninety-three thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •