Base | Representation |
---|---|
bin | 111110111001011… |
… | …011010010000111 |
3 | 2201112121211000000 |
4 | 332321123102013 |
5 | 4130120210401 |
6 | 252413252343 |
7 | 35102255253 |
oct | 7671332207 |
9 | 2645554000 |
10 | 1055241351 |
11 | 4a172449a |
12 | 2554940b3 |
13 | 13a80c188 |
14 | a020b263 |
15 | 62994186 |
hex | 3ee5b487 |
1055241351 has 28 divisors (see below), whose sum is σ = 1586266528. Its totient is φ = 701659584.
The previous prime is 1055241331. The next prime is 1055241377. The reversal of 1055241351 is 1531425501.
1055241351 is a `hidden beast` number, since 1 + 0 + 5 + 524 + 135 + 1 = 666.
It is not a de Polignac number, because 1055241351 - 29 = 1055240839 is a prime.
It is a super-2 number, since 2×10552413512 = 2227068617720610402, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055241331) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 313986 + ... + 317328.
It is an arithmetic number, because the mean of its divisors is an integer number (56652376).
Almost surely, 21055241351 is an apocalyptic number.
1055241351 is a deficient number, since it is larger than the sum of its proper divisors (531025177).
1055241351 is an frugal number, since it uses more digits than its factorization.
1055241351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3794 (or 3779 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
The square root of 1055241351 is about 32484.4786167179. The cubic root of 1055241351 is about 1018.0847537584.
Adding to 1055241351 its reverse (1531425501), we get a palindrome (2586666852).
The spelling of 1055241351 in words is "one billion, fifty-five million, two hundred forty-one thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •