Base | Representation |
---|---|
bin | 111110111001010… |
… | …100111101010011 |
3 | 2201112120111110110 |
4 | 332321110331103 |
5 | 4130113343233 |
6 | 252412532403 |
7 | 35102116602 |
oct | 7671247523 |
9 | 2645514413 |
10 | 1055215443 |
11 | 4a1706a87 |
12 | 255481103 |
13 | 13a800449 |
14 | a0201a39 |
15 | 6298b663 |
hex | 3ee54f53 |
1055215443 has 8 divisors (see below), whose sum is σ = 1407118288. Its totient is φ = 703394784.
The previous prime is 1055215433. The next prime is 1055215451. The reversal of 1055215443 is 3445125501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1055215443 - 218 = 1054953299 is a prime.
It is a super-2 number, since 2×10552154432 = 2226959262291372498, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1055215443.
It is not an unprimeable number, because it can be changed into a prime (1055215433) 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 7 ways as a sum of consecutive naturals, for example, 22005 + ... + 50937.
It is an arithmetic number, because the mean of its divisors is an integer number (175889786).
Almost surely, 21055215443 is an apocalyptic number.
1055215443 is a deficient number, since it is larger than the sum of its proper divisors (351902845).
1055215443 is a wasteful number, since it uses less digits than its factorization.
1055215443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41093.
The product of its (nonzero) digits is 12000, while the sum is 30.
The square root of 1055215443 is about 32484.0798392074. The cubic root of 1055215443 is about 1018.0764217765.
The spelling of 1055215443 in words is "one billion, fifty-five million, two hundred fifteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •