Base | Representation |
---|---|
bin | 111111010000100010… |
… | …0001001101011000110 |
3 | 110222122100121021210112 |
4 | 1332201010021223012 |
5 | 4211203112044100 |
6 | 142223515353022 |
7 | 12546252462104 |
oct | 1764104115306 |
9 | 428570537715 |
10 | 135846206150 |
11 | 52680707366 |
12 | 223b2752772 |
13 | ca6c143905 |
14 | 6809ac2c74 |
15 | 380121cb35 |
hex | 1fa1109ac6 |
135846206150 has 12 divisors (see below), whose sum is σ = 252673943532. Its totient is φ = 54338482440.
The previous prime is 135846206149. The next prime is 135846206159. The reversal of 135846206150 is 51602648531.
It is a junction number, because it is equal to n+sod(n) for n = 135846206098 and 135846206107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135846206159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1358462012 + ... + 1358462111.
It is an arithmetic number, because the mean of its divisors is an integer number (21056161961).
Almost surely, 2135846206150 is an apocalyptic number.
135846206150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
135846206150 is a deficient number, since it is larger than the sum of its proper divisors (116827737382).
135846206150 is a wasteful number, since it uses less digits than its factorization.
135846206150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2716924135 (or 2716924130 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 41.
The spelling of 135846206150 in words is "one hundred thirty-five billion, eight hundred forty-six million, two hundred six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •