Base | Representation |
---|---|
bin | 111110111010100… |
… | …101001101010111 |
3 | 2201120012012100211 |
4 | 332322211031113 |
5 | 4130204403101 |
6 | 252423550251 |
7 | 35104656124 |
oct | 7672451527 |
9 | 2646165324 |
10 | 1055544151 |
11 | 4a1910a42 |
12 | 2555bb387 |
13 | 13a8b6c4c |
14 | a028974b |
15 | 62a03c51 |
hex | 3eea5357 |
1055544151 has 4 divisors (see below), whose sum is σ = 1057324752. Its totient is φ = 1053763552.
The previous prime is 1055544137. The next prime is 1055544163. The reversal of 1055544151 is 1514455501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1055544151 - 219 = 1055019863 is a prime.
It is a super-2 number, since 2×10555441512 = 2228346909420621602, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055545151) 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 3 ways as a sum of consecutive naturals, for example, 889411 + ... + 890596.
It is an arithmetic number, because the mean of its divisors is an integer number (264331188).
Almost surely, 21055544151 is an apocalyptic number.
1055544151 is a deficient number, since it is larger than the sum of its proper divisors (1780601).
1055544151 is an equidigital number, since it uses as much as digits as its factorization.
1055544151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1780600.
The product of its (nonzero) digits is 10000, while the sum is 31.
The square root of 1055544151 is about 32489.1389698157. The cubic root of 1055544151 is about 1018.1821237681.
Adding to 1055544151 its reverse (1514455501), we get a palindrome (2569999652).
The spelling of 1055544151 in words is "one billion, fifty-five million, five hundred forty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •