Base | Representation |
---|---|
bin | 10000001000110… |
… | …00010000000001 |
3 | 100102201021201222 |
4 | 20010120100001 |
5 | 234123200013 |
6 | 21233204425 |
7 | 3232405664 |
oct | 1004302001 |
9 | 312637658 |
10 | 135365633 |
11 | 6a457227 |
12 | 39400715 |
13 | 22076b10 |
14 | 13d996db |
15 | bd3d508 |
hex | 8118401 |
135365633 has 8 divisors (see below), whose sum is σ = 153451200. Its totient is φ = 118376208.
The previous prime is 135365627. The next prime is 135365639. The reversal of 135365633 is 336563531.
It is an interprime number because it is at equal distance from previous prime (135365627) and next prime (135365639).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 135365633 - 212 = 135361537 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 135365593 and 135365602.
It is not an unprimeable number, because it can be changed into a prime (135365639) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 273773 + ... + 274266.
It is an arithmetic number, because the mean of its divisors is an integer number (19181400).
Almost surely, 2135365633 is an apocalyptic number.
135365633 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
135365633 is a deficient number, since it is larger than the sum of its proper divisors (18085567).
135365633 is a wasteful number, since it uses less digits than its factorization.
135365633 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 548071.
The product of its digits is 72900, while the sum is 35.
The square root of 135365633 is about 11634.6737384423. The cubic root of 135365633 is about 513.4554951384.
The spelling of 135365633 in words is "one hundred thirty-five million, three hundred sixty-five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •