Base | Representation |
---|---|
bin | 1000110110011100110… |
… | …1110111010101011101 |
3 | 112112111000022220221201 |
4 | 2031213031313111131 |
5 | 4442402204340013 |
6 | 153504153555501 |
7 | 13662035535244 |
oct | 2154715672535 |
9 | 475430286851 |
10 | 152055543133 |
11 | 5953943212a |
12 | 25577115b91 |
13 | 114533a2c80 |
14 | 750678795b |
15 | 3e4e2b43dd |
hex | 236737755d |
152055543133 has 16 divisors (see below), whose sum is σ = 170920060416. Its totient is φ = 134218465920.
The previous prime is 152055543113. The next prime is 152055543209. The reversal of 152055543133 is 331345550251.
It is a cyclic number.
It is not a de Polignac number, because 152055543133 - 233 = 143465608541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 152055543092 and 152055543101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152055543113) 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, 1015641 + ... + 1155697.
It is an arithmetic number, because the mean of its divisors is an integer number (10682503776).
Almost surely, 2152055543133 is an apocalyptic number.
152055543133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
152055543133 is a deficient number, since it is larger than the sum of its proper divisors (18864517283).
152055543133 is a wasteful number, since it uses less digits than its factorization.
152055543133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143724.
The product of its (nonzero) digits is 135000, while the sum is 37.
The spelling of 152055543133 in words is "one hundred fifty-two billion, fifty-five million, five hundred forty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •