Base | Representation |
---|---|
bin | 1000111110001101010… |
… | …0101010111011111101 |
3 | 112201212010021120011000 |
4 | 2033203110222323331 |
5 | 10011133222432031 |
6 | 154450533520513 |
7 | 14064450564543 |
oct | 2174324527375 |
9 | 481763246130 |
10 | 154137702141 |
11 | 5a407794aa5 |
12 | 25a584a3139 |
13 | 116c5885317 |
14 | 766310bd93 |
15 | 4021ea53e6 |
hex | 23e352aefd |
154137702141 has 16 divisors (see below), whose sum is σ = 240370686400. Its totient is φ = 97350127344.
The previous prime is 154137702139. The next prime is 154137702241. The reversal of 154137702141 is 141207731451.
154137702141 is a `hidden beast` number, since 1 + 541 + 3 + 7 + 70 + 2 + 1 + 41 = 666.
It is not a de Polignac number, because 154137702141 - 21 = 154137702139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 154137702096 and 154137702105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (154137702041) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 150231166 + ... + 150232191.
It is an arithmetic number, because the mean of its divisors is an integer number (15023167900).
Almost surely, 2154137702141 is an apocalyptic number.
It is an amenable number.
154137702141 is a deficient number, since it is larger than the sum of its proper divisors (86232984259).
154137702141 is a wasteful number, since it uses less digits than its factorization.
154137702141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300463385 (or 300463379 counting only the distinct ones).
The product of its (nonzero) digits is 23520, while the sum is 36.
The spelling of 154137702141 in words is "one hundred fifty-four billion, one hundred thirty-seven million, seven hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •