Base | Representation |
---|---|
bin | 11110101110000001101… |
… | …10011100010100011100 |
3 | 10201220102210010210011220 |
4 | 33113000312130110130 |
5 | 114243132114003024 |
6 | 2124520253213340 |
7 | 136154223042300 |
oct | 17270066342434 |
9 | 3656383123156 |
10 | 1055502484764 |
11 | 3776aa6aa212 |
12 | 150691791250 |
13 | 786c200c1c0 |
14 | 3912d879d00 |
15 | 1c6c921be79 |
hex | f5c0d9c51c |
1055502484764 has 144 divisors (see below), whose sum is σ = 3247700400000. Its totient is φ = 263722967424.
The previous prime is 1055502484747. The next prime is 1055502484811. The reversal of 1055502484764 is 4674842055501.
1055502484764 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10555024847642 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3488514 + ... + 3778985.
It is an arithmetic number, because the mean of its divisors is an integer number (22553475000).
Almost surely, 21055502484764 is an apocalyptic number.
1055502484764 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1055502484764 is an abundant number, since it is smaller than the sum of its proper divisors (2192197915236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055502484764 is a wasteful number, since it uses less digits than its factorization.
1055502484764 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7267552 (or 7267543 counting only the distinct ones).
The product of its (nonzero) digits is 5376000, while the sum is 51.
The spelling of 1055502484764 in words is "one trillion, fifty-five billion, five hundred two million, four hundred eighty-four thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.915 sec. • engine limits •