Base | Representation |
---|---|
bin | 11001001101000001… |
… | …01110011111101110 |
3 | 1021220222222210022021 |
4 | 30212200232133232 |
5 | 210202414441100 |
6 | 10114400340354 |
7 | 656211505522 |
oct | 144640563756 |
9 | 37828883267 |
10 | 13531015150 |
11 | 58139a5a54 |
12 | 27576146ba |
13 | 13783c5b53 |
14 | 9250b5d82 |
15 | 542d94a1a |
hex | 32682e7ee |
13531015150 has 48 divisors (see below), whose sum is σ = 25616753280. Its totient is φ = 5316300000.
The previous prime is 13531015111. The next prime is 13531015151. The reversal of 13531015150 is 5151013531.
It is a happy number.
It is a super-3 number, since 3×135310151503 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13531015151) by changing a digit.
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, 1197025 + ... + 1208275.
It is an arithmetic number, because the mean of its divisors is an integer number (533682360).
Almost surely, 213531015150 is an apocalyptic number.
13531015150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13531015150 is a deficient number, since it is larger than the sum of its proper divisors (12085738130).
13531015150 is a wasteful number, since it uses less digits than its factorization.
13531015150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11689 (or 11684 counting only the distinct ones).
The product of its (nonzero) digits is 1125, while the sum is 25.
Adding to 13531015150 its reverse (5151013531), we get a palindrome (18682028681).
The spelling of 13531015150 in words is "thirteen billion, five hundred thirty-one million, fifteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •