Base | Representation |
---|---|
bin | 100011011110111000110100… |
… | …100011110010100010011101 |
3 | 202110112122020011011002002220 |
4 | 203132320310203302202131 |
5 | 130423243022210431031 |
6 | 1311522153125335553 |
7 | 44604355064522346 |
oct | 4336706443624235 |
9 | 673478204132086 |
10 | 156054223530141 |
11 | 457a6251948442 |
12 | 1560442b8675b9 |
13 | 690cb08992591 |
14 | 2a770c98390cd |
15 | 13094dd938596 |
hex | 8dee348f289d |
156054223530141 has 16 divisors (see below), whose sum is σ = 215288119244160. Its totient is φ = 100429602230720.
The previous prime is 156054223530109. The next prime is 156054223530277. The reversal of 156054223530141 is 141035322450651.
It is a cyclic number.
It is not a de Polignac number, because 156054223530141 - 25 = 156054223530109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 156054223530093 and 156054223530102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (156054223530341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 170016225 + ... + 170931638.
It is an arithmetic number, because the mean of its divisors is an integer number (13455507452760).
Almost surely, 2156054223530141 is an apocalyptic number.
It is an amenable number.
156054223530141 is a deficient number, since it is larger than the sum of its proper divisors (59233895714019).
156054223530141 is a wasteful number, since it uses less digits than its factorization.
156054223530141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340953156.
The product of its (nonzero) digits is 432000, while the sum is 42.
Adding to 156054223530141 its reverse (141035322450651), we get a palindrome (297089545980792).
The spelling of 156054223530141 in words is "one hundred fifty-six trillion, fifty-four billion, two hundred twenty-three million, five hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •