Base | Representation |
---|---|
bin | 111110111000101… |
… | …011001101100111 |
3 | 2201112020210220120 |
4 | 332320223031213 |
5 | 4130042410310 |
6 | 252405133023 |
7 | 35100505233 |
oct | 7670531547 |
9 | 2645223816 |
10 | 1055044455 |
11 | 4a15aa573 |
12 | 2553ba173 |
13 | 13a77067a |
14 | a01995c3 |
15 | 62955b70 |
hex | 3ee2b367 |
1055044455 has 16 divisors (see below), whose sum is σ = 1733695584. Its totient is φ = 547482240.
The previous prime is 1055044453. The next prime is 1055044481. The reversal of 1055044455 is 5544405501.
It is not a de Polignac number, because 1055044455 - 21 = 1055044453 is a prime.
It is a super-2 number, since 2×10550444552 = 2226237604052494050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055044453) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 949936 + ... + 951045.
It is an arithmetic number, because the mean of its divisors is an integer number (108355974).
Almost surely, 21055044455 is an apocalyptic number.
1055044455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1055044455 is a deficient number, since it is larger than the sum of its proper divisors (678651129).
1055044455 is a wasteful number, since it uses less digits than its factorization.
1055044455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1901026.
The product of its (nonzero) digits is 40000, while the sum is 33.
The square root of 1055044455 is about 32481.4478587393. The cubic root of 1055044455 is about 1018.0214288188.
Adding to 1055044455 its reverse (5544405501), we get a palindrome (6599449956).
The spelling of 1055044455 in words is "one billion, fifty-five million, forty-four thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •