Base | Representation |
---|---|
bin | 111110111010100… |
… | …100110000101011 |
3 | 2201120012002211211 |
4 | 332322210300223 |
5 | 4130204323230 |
6 | 252423533551 |
7 | 35104650562 |
oct | 7672446053 |
9 | 2646162754 |
10 | 1055542315 |
11 | 4a190a623 |
12 | 2555ba2b7 |
13 | 13a8b6169 |
14 | a0288bd9 |
15 | 62a0342a |
hex | 3eea4c2b |
1055542315 has 8 divisors (see below), whose sum is σ = 1266830208. Its totient is φ = 844314240.
The previous prime is 1055542297. The next prime is 1055542333. The reversal of 1055542315 is 5132455501.
It is an interprime number because it is at equal distance from previous prime (1055542297) and next prime (1055542333).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1055542315 - 29 = 1055541803 is a prime.
It is a super-2 number, since 2×10555423152 = 2228339157511118450, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47875 + ... + 66355.
It is an arithmetic number, because the mean of its divisors is an integer number (158353776).
Almost surely, 21055542315 is an apocalyptic number.
1055542315 is a deficient number, since it is larger than the sum of its proper divisors (211287893).
1055542315 is a wasteful number, since it uses less digits than its factorization.
1055542315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29909.
The product of its (nonzero) digits is 15000, while the sum is 31.
The square root of 1055542315 is about 32489.1107142070. The cubic root of 1055542315 is about 1018.1815334301.
Adding to 1055542315 its reverse (5132455501), we get a palindrome (6187997816).
The spelling of 1055542315 in words is "one billion, fifty-five million, five hundred forty-two thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •