Base | Representation |
---|---|
bin | 101000011000111… |
… | …0010101101010011 |
3 | 10111110002211010000 |
4 | 1100301302231103 |
5 | 10233414330120 |
6 | 342251141043 |
7 | 45404156655 |
oct | 12061625523 |
9 | 3443084100 |
10 | 1355230035 |
11 | 635aa0425 |
12 | 319a44783 |
13 | 187a04a83 |
14 | cbdba6d5 |
15 | 7de9e990 |
hex | 50c72b53 |
1355230035 has 80 divisors (see below), whose sum is σ = 2571015744. Its totient is φ = 681550848.
The previous prime is 1355230013. The next prime is 1355230049. The reversal of 1355230035 is 5300325531.
1355230035 is a `hidden beast` number, since 1 + 355 + 2 + 300 + 3 + 5 = 666.
It is not a de Polignac number, because 1355230035 - 25 = 1355230003 is a prime.
It is a super-2 number, since 2×13552300352 = 3673296895532202450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 1355229990 and 1355230008.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 678999 + ... + 680991.
Almost surely, 21355230035 is an apocalyptic number.
1355230035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1355230035 is a deficient number, since it is larger than the sum of its proper divisors (1215785709).
1355230035 is a wasteful number, since it uses less digits than its factorization.
1355230035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2106 (or 2097 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 27.
The square root of 1355230035 is about 36813.4491049127. The cubic root of 1355230035 is about 1106.6348411135.
Adding to 1355230035 its reverse (5300325531), we get a palindrome (6655555566).
The spelling of 1355230035 in words is "one billion, three hundred fifty-five million, two hundred thirty thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •