Base | Representation |
---|---|
bin | 111110111000101… |
… | …111010001000011 |
3 | 2201112021122200112 |
4 | 332320233101003 |
5 | 4130043423214 |
6 | 252405341535 |
7 | 35100604523 |
oct | 7670572103 |
9 | 2645248615 |
10 | 1055061059 |
11 | 4a1610a98 |
12 | 2554078ab |
13 | 13a7780b0 |
14 | a01a1683 |
15 | 6295aa3e |
hex | 3ee2f443 |
1055061059 has 4 divisors (see below), whose sum is σ = 1136219616. Its totient is φ = 973902504.
The previous prime is 1055061053. The next prime is 1055061101. The reversal of 1055061059 is 9501605501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9501605501 = 29 ⋅327641569.
It is a cyclic number.
It is not a de Polignac number, because 1055061059 - 212 = 1055056963 is a prime.
It is a super-3 number, since 3×10550610593 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1055061053) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 40579259 + ... + 40579284.
It is an arithmetic number, because the mean of its divisors is an integer number (284054904).
Almost surely, 21055061059 is an apocalyptic number.
1055061059 is a deficient number, since it is larger than the sum of its proper divisors (81158557).
1055061059 is an equidigital number, since it uses as much as digits as its factorization.
1055061059 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81158556.
The product of its (nonzero) digits is 6750, while the sum is 32.
The square root of 1055061059 is about 32481.7034497885. The cubic root of 1055061059 is about 1018.0267692380.
The spelling of 1055061059 in words is "one billion, fifty-five million, sixty-one thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •