Base | Representation |
---|---|
bin | 110011101011010101001… |
… | …111000100011111010101 |
3 | 110120111022122212011200120 |
4 | 303223111033010133111 |
5 | 431140344420442203 |
6 | 11315224055302153 |
7 | 514365361030644 |
oct | 63532517043725 |
9 | 13514278764616 |
10 | 3551220484053 |
11 | 114a078423a30 |
12 | 49430067a959 |
13 | 1c9b565346b8 |
14 | c3c4698d35b |
15 | 62596e51b53 |
hex | 33ad53c47d5 |
3551220484053 has 16 divisors (see below), whose sum is σ = 5389994727936. Its totient is φ = 2058678541040.
The previous prime is 3551220484027. The next prime is 3551220484061. The reversal of 3551220484053 is 3504840221553.
It is not a de Polignac number, because 3551220484053 - 230 = 3550146742229 is a prime.
It is a super-2 number, since 2×35512204840532 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3551220483996 and 3551220484014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3551220484853) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2339406675 + ... + 2339408192.
It is an arithmetic number, because the mean of its divisors is an integer number (336874670496).
Almost surely, 23551220484053 is an apocalyptic number.
3551220484053 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
3551220484053 is a deficient number, since it is larger than the sum of its proper divisors (1838774243883).
3551220484053 is a wasteful number, since it uses less digits than its factorization.
3551220484053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4678814904.
The product of its (nonzero) digits is 576000, while the sum is 42.
The spelling of 3551220484053 in words is "three trillion, five hundred fifty-one billion, two hundred twenty million, four hundred eighty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •