Base | Representation |
---|---|
bin | 1000110010111110100… |
… | …1000000101010011111 |
3 | 112110002000211200122011 |
4 | 2030233221000222133 |
5 | 4434000010311020 |
6 | 153231445132051 |
7 | 13626654311500 |
oct | 2145751005237 |
9 | 473060750564 |
10 | 151123135135 |
11 | 59100085205 |
12 | 253569ba027 |
13 | 1133517056b |
14 | 74589d2ba7 |
15 | 3de74d535a |
hex | 232fa40a9f |
151123135135 has 24 divisors (see below), whose sum is σ = 211045122000. Its totient is φ = 103583297664.
The previous prime is 151123135117. The next prime is 151123135157. The reversal of 151123135135 is 531531321151.
151123135135 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 151123135135 - 29 = 151123134623 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 151123135097 and 151123135106.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 452616 + ... + 712114.
It is an arithmetic number, because the mean of its divisors is an integer number (8793546750).
Almost surely, 2151123135135 is an apocalyptic number.
151123135135 is a deficient number, since it is larger than the sum of its proper divisors (59921986865).
151123135135 is a wasteful number, since it uses less digits than its factorization.
151123135135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261895 (or 261888 counting only the distinct ones).
The product of its digits is 6750, while the sum is 31.
Adding to 151123135135 its reverse (531531321151), we get a palindrome (682654456286).
The spelling of 151123135135 in words is "one hundred fifty-one billion, one hundred twenty-three million, one hundred thirty-five thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •