Base | Representation |
---|---|
bin | 101100010011010101111… |
… | …001011000100110100011 |
3 | 101210001012020120020021011 |
4 | 230103111321120212203 |
5 | 344334440402414210 |
6 | 10250331214441351 |
7 | 432644462141260 |
oct | 54232571304643 |
9 | 11701166506234 |
10 | 3044425435555 |
11 | a74151876a79 |
12 | 412043b03257 |
13 | 19111b6ac98a |
14 | a74cb120267 |
15 | 542d49dad8a |
hex | 2c4d5e589a3 |
3044425435555 has 32 divisors (see below), whose sum is σ = 4356894173184. Its totient is φ = 1996771239936.
The previous prime is 3044425435553. The next prime is 3044425435561. The reversal of 3044425435555 is 5555345244403.
3044425435555 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3044425435555 - 21 = 3044425435553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3044425435499 and 3044425435508.
It is not an unprimeable number, because it can be changed into a prime (3044425435553) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 34350979 + ... + 34439491.
It is an arithmetic number, because the mean of its divisors is an integer number (136152942912).
Almost surely, 23044425435555 is an apocalyptic number.
3044425435555 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
3044425435555 is a deficient number, since it is larger than the sum of its proper divisors (1312468737629).
3044425435555 is a wasteful number, since it uses less digits than its factorization.
3044425435555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131275.
The product of its (nonzero) digits is 14400000, while the sum is 49.
The spelling of 3044425435555 in words is "three trillion, forty-four billion, four hundred twenty-five million, four hundred thirty-five thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •