Base | Representation |
---|---|
bin | 1000111011001100110… |
… | …1100011101100111111 |
3 | 112122202212110000200120 |
4 | 2032303031203230333 |
5 | 10003010103444020 |
6 | 154234501230023 |
7 | 14035450003365 |
oct | 2166315435477 |
9 | 478685400616 |
10 | 153330531135 |
11 | 5a0330a6521 |
12 | 25872102313 |
13 | 115c7591442 |
14 | 75c7c37635 |
15 | 3ec61b3740 |
hex | 23b3363b3f |
153330531135 has 8 divisors (see below), whose sum is σ = 245328849840. Its totient is φ = 81776283264.
The previous prime is 153330531127. The next prime is 153330531181. The reversal of 153330531135 is 531135033351.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 153330531135 - 23 = 153330531127 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 153330531096 and 153330531105.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5111017690 + ... + 5111017719.
It is an arithmetic number, because the mean of its divisors is an integer number (30666106230).
Almost surely, 2153330531135 is an apocalyptic number.
153330531135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
153330531135 is a deficient number, since it is larger than the sum of its proper divisors (91998318705).
153330531135 is a wasteful number, since it uses less digits than its factorization.
153330531135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10222035417.
The product of its (nonzero) digits is 30375, while the sum is 33.
Adding to 153330531135 its reverse (531135033351), we get a palindrome (684465564486).
The spelling of 153330531135 in words is "one hundred fifty-three billion, three hundred thirty million, five hundred thirty-one thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •