Base | Representation |
---|---|
bin | 11110101110000110011… |
… | …01010011111010110100 |
3 | 10201220112112120002200010 |
4 | 33113003031103322310 |
5 | 114243222230042400 |
6 | 2124524225020220 |
7 | 136155213152421 |
oct | 17270315237264 |
9 | 3656475502603 |
10 | 1055542034100 |
11 | 37771aa62214 |
12 | 1506a2a84670 |
13 | 786ca278888 |
14 | 39134c12d48 |
15 | 1c6cc930450 |
hex | f5c3353eb4 |
1055542034100 has 72 divisors (see below), whose sum is σ = 3214773651040. Its totient is φ = 266663249280.
The previous prime is 1055542034083. The next prime is 1055542034167. The reversal of 1055542034100 is 14302455501.
It is a super-2 number, since 2×10555420341002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 23 ways as a sum of consecutive naturals, for example, 92585707 + ... + 92597106.
Almost surely, 21055542034100 is an apocalyptic number.
1055542034100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1055542034100 is an abundant number, since it is smaller than the sum of its proper divisors (2159231616940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055542034100 is a wasteful number, since it uses less digits than its factorization.
1055542034100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185182849 (or 185182842 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 1055542034100 its reverse (14302455501), we get a palindrome (1069844489601).
The spelling of 1055542034100 in words is "one trillion, fifty-five billion, five hundred forty-two million, thirty-four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •