Base | Representation |
---|---|
bin | 101000011000100… |
… | …1000000001101011 |
3 | 10111102202221022001 |
4 | 1100301020001223 |
5 | 10233343231321 |
6 | 342243311431 |
7 | 45402531166 |
oct | 12061100153 |
9 | 3442687261 |
10 | 1355055211 |
11 | 635991044 |
12 | 31997b577 |
13 | 187973323 |
14 | cbd72add |
15 | 7de67c91 |
hex | 50c4806b |
1355055211 has 4 divisors (see below), whose sum is σ = 1355295312. Its totient is φ = 1354815112.
The previous prime is 1355055161. The next prime is 1355055217. The reversal of 1355055211 is 1125505531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1125505531 = 2311 ⋅487021.
It is a cyclic number.
It is not a de Polignac number, because 1355055211 - 215 = 1355022443 is a prime.
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 1355055211.
It is not an unprimeable number, because it can be changed into a prime (1355055217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 111376 + ... + 122941.
It is an arithmetic number, because the mean of its divisors is an integer number (338823828).
Almost surely, 21355055211 is an apocalyptic number.
1355055211 is a deficient number, since it is larger than the sum of its proper divisors (240101).
1355055211 is an equidigital number, since it uses as much as digits as its factorization.
1355055211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240100.
The product of its (nonzero) digits is 3750, while the sum is 28.
The square root of 1355055211 is about 36811.0745700258. The cubic root of 1355055211 is about 1106.5872539527.
The spelling of 1355055211 in words is "one billion, three hundred fifty-five million, fifty-five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •